java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:25:11,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:25:11,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:25:11,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:25:11,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:25:11,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:25:11,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:25:11,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:25:11,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:25:11,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:25:11,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:25:11,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:25:11,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:25:11,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:25:11,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:25:11,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:25:11,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:25:11,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:25:11,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:25:11,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:25:11,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:25:11,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:25:11,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:25:11,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:25:11,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:25:11,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:25:11,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:25:11,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:25:11,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:25:11,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:25:11,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:25:11,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:25:11,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:25:11,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:25:11,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:25:11,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:25:11,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:25:11,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:25:11,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:25:11,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:25:11,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:25:11,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:25:11,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:25:11,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:25:11,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:25:11,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:25:11,923 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:25:11,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:25:11,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:25:11,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:25:11,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:25:11,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:25:11,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:25:11,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:25:11,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:25:11,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:25:11,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:25:11,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:25:11,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:25:11,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:25:11,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:25:11,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:25:11,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:25:11,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:11,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:25:11,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:25:11,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:25:11,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:25:11,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:25:11,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:25:11,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:25:12,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:25:12,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:25:12,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:25:12,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:25:12,327 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:25:12,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:12,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e340443/8c5275cd377a4bfe885e95081040bd13/FLAGa6a0c3d22 [2019-10-13 21:25:12,844 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:25:12,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:12,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e340443/8c5275cd377a4bfe885e95081040bd13/FLAGa6a0c3d22 [2019-10-13 21:25:13,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e340443/8c5275cd377a4bfe885e95081040bd13 [2019-10-13 21:25:13,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:25:13,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:25:13,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:13,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:25:13,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:25:13,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3309b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13, skipping insertion in model container [2019-10-13 21:25:13,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,260 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:25:13,317 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:25:13,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:13,797 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:25:13,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:13,903 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:25:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13 WrapperNode [2019-10-13 21:25:13,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:13,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:25:13,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:25:13,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:25:13,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... [2019-10-13 21:25:13,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:25:13,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:25:13,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:25:13,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:25:13,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:14,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 21:25:14,031 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 21:25:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 21:25:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 21:25:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:25:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 21:25:14,032 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:25:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:25:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:25:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:25:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 21:25:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 21:25:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 21:25:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 21:25:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:25:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:14,884 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:14,884 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:25:14,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:14 BoogieIcfgContainer [2019-10-13 21:25:14,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:14,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:14,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:14,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:14,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:25:13" (1/3) ... [2019-10-13 21:25:14,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffa03e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:14, skipping insertion in model container [2019-10-13 21:25:14,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:13" (2/3) ... [2019-10-13 21:25:14,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffa03e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:14, skipping insertion in model container [2019-10-13 21:25:14,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:14" (3/3) ... [2019-10-13 21:25:14,901 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:14,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:14,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:14,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:14,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:14,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:14,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:14,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:14,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:14,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:14,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:14,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-13 21:25:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:25:14,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:15,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash -95402615, now seen corresponding path program 1 times [2019-10-13 21:25:15,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082486596] [2019-10-13 21:25:15,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:15,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082486596] [2019-10-13 21:25:15,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:15,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592178373] [2019-10-13 21:25:15,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:15,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:15,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:15,458 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2019-10-13 21:25:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,554 INFO L93 Difference]: Finished difference Result 448 states and 692 transitions. [2019-10-13 21:25:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:15,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-13 21:25:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,572 INFO L225 Difference]: With dead ends: 448 [2019-10-13 21:25:15,572 INFO L226 Difference]: Without dead ends: 231 [2019-10-13 21:25:15,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-13 21:25:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-10-13 21:25:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-13 21:25:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2019-10-13 21:25:15,661 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 65 [2019-10-13 21:25:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:15,661 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2019-10-13 21:25:15,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2019-10-13 21:25:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:25:15,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:15,666 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1971874243, now seen corresponding path program 1 times [2019-10-13 21:25:15,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471939580] [2019-10-13 21:25:15,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:15,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471939580] [2019-10-13 21:25:15,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:15,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747337685] [2019-10-13 21:25:15,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:15,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:15,901 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand 4 states. [2019-10-13 21:25:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,992 INFO L93 Difference]: Finished difference Result 444 states and 634 transitions. [2019-10-13 21:25:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:15,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 21:25:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,997 INFO L225 Difference]: With dead ends: 444 [2019-10-13 21:25:15,998 INFO L226 Difference]: Without dead ends: 235 [2019-10-13 21:25:16,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-13 21:25:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-10-13 21:25:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-13 21:25:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 326 transitions. [2019-10-13 21:25:16,024 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 326 transitions. Word has length 76 [2019-10-13 21:25:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:16,025 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 326 transitions. [2019-10-13 21:25:16,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2019-10-13 21:25:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:25:16,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:16,029 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:16,029 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 350215030, now seen corresponding path program 1 times [2019-10-13 21:25:16,030 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:16,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610827534] [2019-10-13 21:25:16,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:16,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610827534] [2019-10-13 21:25:16,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:16,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:16,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812318567] [2019-10-13 21:25:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:16,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:16,187 INFO L87 Difference]: Start difference. First operand 235 states and 326 transitions. Second operand 7 states. [2019-10-13 21:25:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,490 INFO L93 Difference]: Finished difference Result 535 states and 744 transitions. [2019-10-13 21:25:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:17,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:25:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,497 INFO L225 Difference]: With dead ends: 535 [2019-10-13 21:25:17,497 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 21:25:17,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 21:25:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-10-13 21:25:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-13 21:25:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-10-13 21:25:17,531 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 94 [2019-10-13 21:25:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,532 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-10-13 21:25:17,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-10-13 21:25:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:25:17,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:17,535 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1125111825, now seen corresponding path program 1 times [2019-10-13 21:25:17,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062979895] [2019-10-13 21:25:17,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:17,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062979895] [2019-10-13 21:25:17,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:17,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944538712] [2019-10-13 21:25:17,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:17,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:17,660 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 7 states. [2019-10-13 21:25:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:18,832 INFO L93 Difference]: Finished difference Result 541 states and 752 transitions. [2019-10-13 21:25:18,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:18,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:25:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:18,836 INFO L225 Difference]: With dead ends: 541 [2019-10-13 21:25:18,836 INFO L226 Difference]: Without dead ends: 325 [2019-10-13 21:25:18,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-13 21:25:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-10-13 21:25:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-13 21:25:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-10-13 21:25:18,862 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 95 [2019-10-13 21:25:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,863 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-10-13 21:25:18,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-10-13 21:25:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:18,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:18,866 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1068609311, now seen corresponding path program 1 times [2019-10-13 21:25:18,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140219808] [2019-10-13 21:25:18,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:18,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140219808] [2019-10-13 21:25:18,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:18,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130869377] [2019-10-13 21:25:18,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:18,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:18,955 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 3 states. [2019-10-13 21:25:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,000 INFO L93 Difference]: Finished difference Result 770 states and 1075 transitions. [2019-10-13 21:25:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:19,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,005 INFO L225 Difference]: With dead ends: 770 [2019-10-13 21:25:19,005 INFO L226 Difference]: Without dead ends: 554 [2019-10-13 21:25:19,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-13 21:25:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 537. [2019-10-13 21:25:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-13 21:25:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 745 transitions. [2019-10-13 21:25:19,052 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 745 transitions. Word has length 97 [2019-10-13 21:25:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 745 transitions. [2019-10-13 21:25:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 745 transitions. [2019-10-13 21:25:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:19,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,055 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2002189277, now seen corresponding path program 1 times [2019-10-13 21:25:19,056 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283549420] [2019-10-13 21:25:19,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:19,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283549420] [2019-10-13 21:25:19,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:19,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236716055] [2019-10-13 21:25:19,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:19,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:19,141 INFO L87 Difference]: Start difference. First operand 537 states and 745 transitions. Second operand 3 states. [2019-10-13 21:25:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,203 INFO L93 Difference]: Finished difference Result 927 states and 1308 transitions. [2019-10-13 21:25:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:19,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 21:25:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,208 INFO L225 Difference]: With dead ends: 927 [2019-10-13 21:25:19,209 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 21:25:19,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 21:25:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-13 21:25:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-13 21:25:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 744 transitions. [2019-10-13 21:25:19,245 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 744 transitions. Word has length 98 [2019-10-13 21:25:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,245 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 744 transitions. [2019-10-13 21:25:19,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 744 transitions. [2019-10-13 21:25:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:19,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1591713441, now seen corresponding path program 1 times [2019-10-13 21:25:19,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133589363] [2019-10-13 21:25:19,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:19,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133589363] [2019-10-13 21:25:19,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:19,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565893897] [2019-10-13 21:25:19,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:19,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:19,331 INFO L87 Difference]: Start difference. First operand 537 states and 744 transitions. Second operand 3 states. [2019-10-13 21:25:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,397 INFO L93 Difference]: Finished difference Result 1168 states and 1640 transitions. [2019-10-13 21:25:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:19,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 21:25:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,404 INFO L225 Difference]: With dead ends: 1168 [2019-10-13 21:25:19,405 INFO L226 Difference]: Without dead ends: 728 [2019-10-13 21:25:19,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-13 21:25:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 722. [2019-10-13 21:25:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-13 21:25:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1008 transitions. [2019-10-13 21:25:19,464 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1008 transitions. Word has length 98 [2019-10-13 21:25:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,465 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1008 transitions. [2019-10-13 21:25:19,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1008 transitions. [2019-10-13 21:25:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:19,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,467 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1901314178, now seen corresponding path program 1 times [2019-10-13 21:25:19,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959916898] [2019-10-13 21:25:19,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:19,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959916898] [2019-10-13 21:25:19,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:19,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645752944] [2019-10-13 21:25:19,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:19,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:19,583 INFO L87 Difference]: Start difference. First operand 722 states and 1008 transitions. Second operand 4 states. [2019-10-13 21:25:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,642 INFO L93 Difference]: Finished difference Result 1308 states and 1853 transitions. [2019-10-13 21:25:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:19,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 21:25:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,648 INFO L225 Difference]: With dead ends: 1308 [2019-10-13 21:25:19,649 INFO L226 Difference]: Without dead ends: 737 [2019-10-13 21:25:19,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-13 21:25:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-10-13 21:25:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-13 21:25:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2019-10-13 21:25:19,701 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 98 [2019-10-13 21:25:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,702 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2019-10-13 21:25:19,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2019-10-13 21:25:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:25:19,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,706 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,706 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1229557918, now seen corresponding path program 1 times [2019-10-13 21:25:19,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843540397] [2019-10-13 21:25:19,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:19,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843540397] [2019-10-13 21:25:19,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:19,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927559722] [2019-10-13 21:25:19,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:19,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:19,831 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand 4 states. [2019-10-13 21:25:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,927 INFO L93 Difference]: Finished difference Result 1338 states and 1886 transitions. [2019-10-13 21:25:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:19,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:25:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,934 INFO L225 Difference]: With dead ends: 1338 [2019-10-13 21:25:19,934 INFO L226 Difference]: Without dead ends: 752 [2019-10-13 21:25:19,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-13 21:25:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-10-13 21:25:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-13 21:25:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1032 transitions. [2019-10-13 21:25:19,981 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1032 transitions. Word has length 106 [2019-10-13 21:25:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,981 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1032 transitions. [2019-10-13 21:25:19,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1032 transitions. [2019-10-13 21:25:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:25:19,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,984 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,984 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1709526252, now seen corresponding path program 1 times [2019-10-13 21:25:19,986 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462151291] [2019-10-13 21:25:19,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:20,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462151291] [2019-10-13 21:25:20,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:20,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:20,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610221047] [2019-10-13 21:25:20,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:20,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:20,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:20,117 INFO L87 Difference]: Start difference. First operand 752 states and 1032 transitions. Second operand 4 states. [2019-10-13 21:25:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:20,199 INFO L93 Difference]: Finished difference Result 1365 states and 1898 transitions. [2019-10-13 21:25:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:20,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:25:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:20,207 INFO L225 Difference]: With dead ends: 1365 [2019-10-13 21:25:20,208 INFO L226 Difference]: Without dead ends: 764 [2019-10-13 21:25:20,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-13 21:25:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-10-13 21:25:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-10-13 21:25:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1041 transitions. [2019-10-13 21:25:20,281 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1041 transitions. Word has length 114 [2019-10-13 21:25:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,281 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1041 transitions. [2019-10-13 21:25:20,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1041 transitions. [2019-10-13 21:25:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:25:20,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:20,288 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -20152056, now seen corresponding path program 1 times [2019-10-13 21:25:20,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237280237] [2019-10-13 21:25:20,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:20,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237280237] [2019-10-13 21:25:20,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:20,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:20,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251823538] [2019-10-13 21:25:20,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:20,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:20,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:20,433 INFO L87 Difference]: Start difference. First operand 764 states and 1041 transitions. Second operand 4 states. [2019-10-13 21:25:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:20,516 INFO L93 Difference]: Finished difference Result 1392 states and 1928 transitions. [2019-10-13 21:25:20,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:20,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:25:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:20,523 INFO L225 Difference]: With dead ends: 1392 [2019-10-13 21:25:20,523 INFO L226 Difference]: Without dead ends: 779 [2019-10-13 21:25:20,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-13 21:25:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2019-10-13 21:25:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-10-13 21:25:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1053 transitions. [2019-10-13 21:25:20,576 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1053 transitions. Word has length 114 [2019-10-13 21:25:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,576 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1053 transitions. [2019-10-13 21:25:20,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1053 transitions. [2019-10-13 21:25:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:25:20,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,579 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:20,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1453300596, now seen corresponding path program 1 times [2019-10-13 21:25:20,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842639013] [2019-10-13 21:25:20,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:25:20,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842639013] [2019-10-13 21:25:20,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:20,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:20,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273865805] [2019-10-13 21:25:20,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:20,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:20,674 INFO L87 Difference]: Start difference. First operand 779 states and 1053 transitions. Second operand 4 states. [2019-10-13 21:25:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:20,746 INFO L93 Difference]: Finished difference Result 1425 states and 1949 transitions. [2019-10-13 21:25:20,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:20,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 21:25:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:20,752 INFO L225 Difference]: With dead ends: 1425 [2019-10-13 21:25:20,753 INFO L226 Difference]: Without dead ends: 797 [2019-10-13 21:25:20,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-13 21:25:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-13 21:25:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-13 21:25:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1068 transitions. [2019-10-13 21:25:20,840 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1068 transitions. Word has length 122 [2019-10-13 21:25:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,841 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1068 transitions. [2019-10-13 21:25:20,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1068 transitions. [2019-10-13 21:25:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:25:20,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,844 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:20,844 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1290490955, now seen corresponding path program 1 times [2019-10-13 21:25:20,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330590480] [2019-10-13 21:25:20,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:25:21,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330590480] [2019-10-13 21:25:21,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:21,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:21,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33331381] [2019-10-13 21:25:21,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:21,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:21,032 INFO L87 Difference]: Start difference. First operand 797 states and 1068 transitions. Second operand 10 states. [2019-10-13 21:25:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,783 INFO L93 Difference]: Finished difference Result 2083 states and 2774 transitions. [2019-10-13 21:25:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:23,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-10-13 21:25:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,793 INFO L225 Difference]: With dead ends: 2083 [2019-10-13 21:25:23,794 INFO L226 Difference]: Without dead ends: 1428 [2019-10-13 21:25:23,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-10-13 21:25:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1335. [2019-10-13 21:25:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-10-13 21:25:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1758 transitions. [2019-10-13 21:25:23,905 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1758 transitions. Word has length 127 [2019-10-13 21:25:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,905 INFO L462 AbstractCegarLoop]: Abstraction has 1335 states and 1758 transitions. [2019-10-13 21:25:23,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1758 transitions. [2019-10-13 21:25:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:25:23,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,908 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:23,908 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1610878183, now seen corresponding path program 1 times [2019-10-13 21:25:23,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905805442] [2019-10-13 21:25:23,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:25:23,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905805442] [2019-10-13 21:25:23,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:23,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002945526] [2019-10-13 21:25:23,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:23,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:23,987 INFO L87 Difference]: Start difference. First operand 1335 states and 1758 transitions. Second operand 4 states. [2019-10-13 21:25:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,070 INFO L93 Difference]: Finished difference Result 2422 states and 3209 transitions. [2019-10-13 21:25:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:24,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-13 21:25:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,079 INFO L225 Difference]: With dead ends: 2422 [2019-10-13 21:25:24,079 INFO L226 Difference]: Without dead ends: 1347 [2019-10-13 21:25:24,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-10-13 21:25:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1341. [2019-10-13 21:25:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-10-13 21:25:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1745 transitions. [2019-10-13 21:25:24,159 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1745 transitions. Word has length 129 [2019-10-13 21:25:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,160 INFO L462 AbstractCegarLoop]: Abstraction has 1341 states and 1745 transitions. [2019-10-13 21:25:24,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1745 transitions. [2019-10-13 21:25:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:25:24,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,163 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:24,163 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1804269052, now seen corresponding path program 1 times [2019-10-13 21:25:24,164 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781592810] [2019-10-13 21:25:24,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:25:24,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781592810] [2019-10-13 21:25:24,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:24,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734957648] [2019-10-13 21:25:24,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:24,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:24,318 INFO L87 Difference]: Start difference. First operand 1341 states and 1745 transitions. Second operand 9 states. [2019-10-13 21:25:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:26,260 INFO L93 Difference]: Finished difference Result 2761 states and 3567 transitions. [2019-10-13 21:25:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:25:26,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-13 21:25:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:26,276 INFO L225 Difference]: With dead ends: 2761 [2019-10-13 21:25:26,276 INFO L226 Difference]: Without dead ends: 1731 [2019-10-13 21:25:26,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:25:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-10-13 21:25:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1464. [2019-10-13 21:25:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-13 21:25:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1879 transitions. [2019-10-13 21:25:26,460 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1879 transitions. Word has length 131 [2019-10-13 21:25:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:26,460 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 1879 transitions. [2019-10-13 21:25:26,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1879 transitions. [2019-10-13 21:25:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:25:26,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:26,465 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:26,465 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 77285222, now seen corresponding path program 1 times [2019-10-13 21:25:26,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:26,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877078908] [2019-10-13 21:25:26,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:26,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877078908] [2019-10-13 21:25:26,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:26,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:26,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094463923] [2019-10-13 21:25:26,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:26,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:26,627 INFO L87 Difference]: Start difference. First operand 1464 states and 1879 transitions. Second operand 7 states. [2019-10-13 21:25:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:26,734 INFO L93 Difference]: Finished difference Result 1563 states and 2020 transitions. [2019-10-13 21:25:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:25:26,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-13 21:25:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:26,745 INFO L225 Difference]: With dead ends: 1563 [2019-10-13 21:25:26,745 INFO L226 Difference]: Without dead ends: 1561 [2019-10-13 21:25:26,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-10-13 21:25:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1485. [2019-10-13 21:25:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-10-13 21:25:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1902 transitions. [2019-10-13 21:25:26,837 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1902 transitions. Word has length 130 [2019-10-13 21:25:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:26,837 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 1902 transitions. [2019-10-13 21:25:26,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1902 transitions. [2019-10-13 21:25:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:25:26,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:26,840 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:26,840 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1402644889, now seen corresponding path program 1 times [2019-10-13 21:25:26,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:26,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206044440] [2019-10-13 21:25:26,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:27,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206044440] [2019-10-13 21:25:27,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:27,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:27,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865113502] [2019-10-13 21:25:27,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:27,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:27,013 INFO L87 Difference]: Start difference. First operand 1485 states and 1902 transitions. Second operand 10 states. [2019-10-13 21:25:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:30,112 INFO L93 Difference]: Finished difference Result 3885 states and 4945 transitions. [2019-10-13 21:25:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:30,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-10-13 21:25:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:30,127 INFO L225 Difference]: With dead ends: 3885 [2019-10-13 21:25:30,127 INFO L226 Difference]: Without dead ends: 2753 [2019-10-13 21:25:30,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-10-13 21:25:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1910. [2019-10-13 21:25:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 21:25:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2432 transitions. [2019-10-13 21:25:30,257 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2432 transitions. Word has length 135 [2019-10-13 21:25:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:30,258 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2432 transitions. [2019-10-13 21:25:30,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2432 transitions. [2019-10-13 21:25:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:25:30,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:30,262 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:30,262 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:30,263 INFO L82 PathProgramCache]: Analyzing trace with hash 168273907, now seen corresponding path program 1 times [2019-10-13 21:25:30,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:30,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822743540] [2019-10-13 21:25:30,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:30,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:30,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:30,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822743540] [2019-10-13 21:25:30,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:30,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:30,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147637866] [2019-10-13 21:25:30,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:30,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:30,384 INFO L87 Difference]: Start difference. First operand 1910 states and 2432 transitions. Second operand 5 states. [2019-10-13 21:25:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:30,820 INFO L93 Difference]: Finished difference Result 6592 states and 8494 transitions. [2019-10-13 21:25:30,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:30,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-13 21:25:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:30,848 INFO L225 Difference]: With dead ends: 6592 [2019-10-13 21:25:30,848 INFO L226 Difference]: Without dead ends: 4980 [2019-10-13 21:25:30,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-10-13 21:25:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 4524. [2019-10-13 21:25:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4524 states. [2019-10-13 21:25:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5774 transitions. [2019-10-13 21:25:31,195 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5774 transitions. Word has length 136 [2019-10-13 21:25:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:31,196 INFO L462 AbstractCegarLoop]: Abstraction has 4524 states and 5774 transitions. [2019-10-13 21:25:31,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5774 transitions. [2019-10-13 21:25:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:25:31,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:31,201 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:31,201 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2010406403, now seen corresponding path program 1 times [2019-10-13 21:25:31,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:31,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896764431] [2019-10-13 21:25:31,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:31,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:25:31,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896764431] [2019-10-13 21:25:31,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:31,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:31,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067063632] [2019-10-13 21:25:31,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:31,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:31,412 INFO L87 Difference]: Start difference. First operand 4524 states and 5774 transitions. Second operand 9 states. [2019-10-13 21:25:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:32,711 INFO L93 Difference]: Finished difference Result 7988 states and 10286 transitions. [2019-10-13 21:25:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:25:32,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-13 21:25:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:32,733 INFO L225 Difference]: With dead ends: 7988 [2019-10-13 21:25:32,733 INFO L226 Difference]: Without dead ends: 4063 [2019-10-13 21:25:32,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:25:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2019-10-13 21:25:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3498. [2019-10-13 21:25:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3498 states. [2019-10-13 21:25:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4456 transitions. [2019-10-13 21:25:32,937 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4456 transitions. Word has length 137 [2019-10-13 21:25:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:32,939 INFO L462 AbstractCegarLoop]: Abstraction has 3498 states and 4456 transitions. [2019-10-13 21:25:32,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4456 transitions. [2019-10-13 21:25:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:32,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:32,943 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:32,943 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:32,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:32,943 INFO L82 PathProgramCache]: Analyzing trace with hash 536828905, now seen corresponding path program 1 times [2019-10-13 21:25:32,944 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:32,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336018016] [2019-10-13 21:25:32,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:32,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:32,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:25:33,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336018016] [2019-10-13 21:25:33,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:33,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:33,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488138333] [2019-10-13 21:25:33,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:33,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:33,107 INFO L87 Difference]: Start difference. First operand 3498 states and 4456 transitions. Second operand 9 states. [2019-10-13 21:25:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:34,806 INFO L93 Difference]: Finished difference Result 7105 states and 9198 transitions. [2019-10-13 21:25:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:25:34,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-10-13 21:25:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:34,827 INFO L225 Difference]: With dead ends: 7105 [2019-10-13 21:25:34,828 INFO L226 Difference]: Without dead ends: 3963 [2019-10-13 21:25:34,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:25:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-10-13 21:25:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3399. [2019-10-13 21:25:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2019-10-13 21:25:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4331 transitions. [2019-10-13 21:25:35,035 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4331 transitions. Word has length 138 [2019-10-13 21:25:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:35,036 INFO L462 AbstractCegarLoop]: Abstraction has 3399 states and 4331 transitions. [2019-10-13 21:25:35,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4331 transitions. [2019-10-13 21:25:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:35,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:35,039 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:35,039 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1537146296, now seen corresponding path program 1 times [2019-10-13 21:25:35,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:35,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570199833] [2019-10-13 21:25:35,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:35,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:35,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:35,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570199833] [2019-10-13 21:25:35,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:35,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:35,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800961376] [2019-10-13 21:25:35,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:35,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:35,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:35,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:35,123 INFO L87 Difference]: Start difference. First operand 3399 states and 4331 transitions. Second operand 5 states. [2019-10-13 21:25:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:35,753 INFO L93 Difference]: Finished difference Result 10453 states and 13435 transitions. [2019-10-13 21:25:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:35,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-13 21:25:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:35,785 INFO L225 Difference]: With dead ends: 10453 [2019-10-13 21:25:35,785 INFO L226 Difference]: Without dead ends: 7571 [2019-10-13 21:25:35,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-10-13 21:25:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 5216. [2019-10-13 21:25:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-10-13 21:25:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 6637 transitions. [2019-10-13 21:25:36,239 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 6637 transitions. Word has length 139 [2019-10-13 21:25:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:36,239 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 6637 transitions. [2019-10-13 21:25:36,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 6637 transitions. [2019-10-13 21:25:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:36,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:36,244 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:36,244 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash -541847865, now seen corresponding path program 1 times [2019-10-13 21:25:36,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:36,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786033918] [2019-10-13 21:25:36,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:36,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:36,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:36,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786033918] [2019-10-13 21:25:36,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:36,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:36,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519130172] [2019-10-13 21:25:36,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:36,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:36,338 INFO L87 Difference]: Start difference. First operand 5216 states and 6637 transitions. Second operand 5 states. [2019-10-13 21:25:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:37,026 INFO L93 Difference]: Finished difference Result 12095 states and 15451 transitions. [2019-10-13 21:25:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:37,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-13 21:25:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:37,057 INFO L225 Difference]: With dead ends: 12095 [2019-10-13 21:25:37,057 INFO L226 Difference]: Without dead ends: 7535 [2019-10-13 21:25:37,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7535 states. [2019-10-13 21:25:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7535 to 6989. [2019-10-13 21:25:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-10-13 21:25:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 8847 transitions. [2019-10-13 21:25:37,497 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 8847 transitions. Word has length 139 [2019-10-13 21:25:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:37,498 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 8847 transitions. [2019-10-13 21:25:37,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 8847 transitions. [2019-10-13 21:25:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:25:37,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:37,503 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:37,503 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1241684620, now seen corresponding path program 1 times [2019-10-13 21:25:37,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:37,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450307890] [2019-10-13 21:25:37,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:37,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:37,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:37,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450307890] [2019-10-13 21:25:37,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:37,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:37,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763356015] [2019-10-13 21:25:37,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:37,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:37,563 INFO L87 Difference]: Start difference. First operand 6989 states and 8847 transitions. Second operand 3 states. [2019-10-13 21:25:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:38,084 INFO L93 Difference]: Finished difference Result 13457 states and 17105 transitions. [2019-10-13 21:25:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-13 21:25:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:38,110 INFO L225 Difference]: With dead ends: 13457 [2019-10-13 21:25:38,110 INFO L226 Difference]: Without dead ends: 7058 [2019-10-13 21:25:38,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2019-10-13 21:25:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 6995. [2019-10-13 21:25:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-10-13 21:25:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 8853 transitions. [2019-10-13 21:25:38,537 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 8853 transitions. Word has length 140 [2019-10-13 21:25:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:38,537 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 8853 transitions. [2019-10-13 21:25:38,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 8853 transitions. [2019-10-13 21:25:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:25:38,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:38,542 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:38,542 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:38,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1911015683, now seen corresponding path program 1 times [2019-10-13 21:25:38,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:38,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017779096] [2019-10-13 21:25:38,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:39,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017779096] [2019-10-13 21:25:39,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:39,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:25:39,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254088386] [2019-10-13 21:25:39,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:25:39,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:25:39,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:39,412 INFO L87 Difference]: Start difference. First operand 6995 states and 8853 transitions. Second operand 12 states. [2019-10-13 21:25:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:42,617 INFO L93 Difference]: Finished difference Result 14110 states and 17887 transitions. [2019-10-13 21:25:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:25:42,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-10-13 21:25:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:42,643 INFO L225 Difference]: With dead ends: 14110 [2019-10-13 21:25:42,643 INFO L226 Difference]: Without dead ends: 7274 [2019-10-13 21:25:42,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:25:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7274 states. [2019-10-13 21:25:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7274 to 7054. [2019-10-13 21:25:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7054 states. [2019-10-13 21:25:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 8918 transitions. [2019-10-13 21:25:43,129 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 8918 transitions. Word has length 141 [2019-10-13 21:25:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:43,130 INFO L462 AbstractCegarLoop]: Abstraction has 7054 states and 8918 transitions. [2019-10-13 21:25:43,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:25:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 8918 transitions. [2019-10-13 21:25:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:25:43,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:43,134 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:43,135 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1882515393, now seen corresponding path program 1 times [2019-10-13 21:25:43,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:43,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135544029] [2019-10-13 21:25:43,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:43,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:43,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135544029] [2019-10-13 21:25:43,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:43,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 21:25:43,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142137846] [2019-10-13 21:25:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 21:25:43,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 21:25:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:25:43,561 INFO L87 Difference]: Start difference. First operand 7054 states and 8918 transitions. Second operand 14 states.