java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:24:07,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:24:07,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:24:07,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:24:07,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:24:07,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:24:07,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:24:07,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:24:07,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:24:07,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:24:07,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:24:07,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:24:07,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:24:07,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:24:07,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:24:07,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:24:07,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:24:07,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:24:07,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:24:07,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:24:07,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:24:07,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:24:07,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:24:07,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:24:07,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:24:07,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:24:07,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:24:07,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:24:07,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:24:07,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:24:07,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:24:07,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:24:07,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:24:07,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:24:07,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:24:07,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:24:07,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:24:07,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:24:07,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:24:07,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:24:07,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:24:07,104 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-15 01:24:07,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:24:07,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:24:07,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:24:07,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:24:07,132 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:24:07,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:24:07,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:24:07,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:24:07,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:24:07,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:24:07,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:24:07,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:24:07,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:24:07,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:24:07,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:24:07,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:24:07,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:24:07,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:24:07,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:24:07,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:24:07,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:24:07,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:07,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:24:07,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:24:07,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:24:07,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:24:07,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:24:07,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:24:07,137 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-15 01:24:07,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:24:07,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:24:07,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:24:07,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:24:07,426 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:24:07,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:07,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38266a5d/c36ca8e557d84bf0976dc2e8aea6d21b/FLAG82d18a9ed [2019-10-15 01:24:08,036 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:24:08,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:08,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38266a5d/c36ca8e557d84bf0976dc2e8aea6d21b/FLAG82d18a9ed [2019-10-15 01:24:08,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38266a5d/c36ca8e557d84bf0976dc2e8aea6d21b [2019-10-15 01:24:08,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:24:08,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:24:08,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:08,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:24:08,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:24:08,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:08,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8c168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08, skipping insertion in model container [2019-10-15 01:24:08,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:08,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:24:08,437 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:24:08,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:08,854 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:08,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:08,972 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:08,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08 WrapperNode [2019-10-15 01:24:08,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:08,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:08,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:08,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:08,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:08,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:08,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:08,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:09,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:09,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:09,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (1/1) ... [2019-10-15 01:24:09,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:09,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:09,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:09,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:09,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (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-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 01:24:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:09,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:09,094 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 01:24:09,095 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:09,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:09,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:10,000 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:10,001 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:24:10,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:10 BoogieIcfgContainer [2019-10-15 01:24:10,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:10,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:10,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:10,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:10,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:24:08" (1/3) ... [2019-10-15 01:24:10,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2819e2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:10, skipping insertion in model container [2019-10-15 01:24:10,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:08" (2/3) ... [2019-10-15 01:24:10,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2819e2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:10, skipping insertion in model container [2019-10-15 01:24:10,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:10" (3/3) ... [2019-10-15 01:24:10,015 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:10,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:10,036 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:10,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:10,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:10,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:10,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:10,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:10,081 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:10,081 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:10,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:10,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-10-15 01:24:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:24:10,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,135 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-15 01:24:10,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash -512765460, now seen corresponding path program 1 times [2019-10-15 01:24:10,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046006871] [2019-10-15 01:24:10,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,602 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-15 01:24:10,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046006871] [2019-10-15 01:24:10,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636338267] [2019-10-15 01:24:10,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,630 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2019-10-15 01:24:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,765 INFO L93 Difference]: Finished difference Result 455 states and 698 transitions. [2019-10-15 01:24:10,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-15 01:24:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,793 INFO L225 Difference]: With dead ends: 455 [2019-10-15 01:24:10,793 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 01:24:10,806 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-15 01:24:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 01:24:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-15 01:24:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:24:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-10-15 01:24:10,871 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 65 [2019-10-15 01:24:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,871 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-10-15 01:24:10,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-10-15 01:24:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:24:10,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:10,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1221172995, now seen corresponding path program 1 times [2019-10-15 01:24:10,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205479554] [2019-10-15 01:24:10,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:11,103 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-15 01:24:11,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205479554] [2019-10-15 01:24:11,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:11,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:11,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690069295] [2019-10-15 01:24:11,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:11,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:11,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:11,108 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 4 states. [2019-10-15 01:24:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:11,231 INFO L93 Difference]: Finished difference Result 446 states and 636 transitions. [2019-10-15 01:24:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:11,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 01:24:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:11,235 INFO L225 Difference]: With dead ends: 446 [2019-10-15 01:24:11,235 INFO L226 Difference]: Without dead ends: 236 [2019-10-15 01:24:11,238 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-15 01:24:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-15 01:24:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-10-15 01:24:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-15 01:24:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-10-15 01:24:11,267 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 76 [2019-10-15 01:24:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:11,268 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-10-15 01:24:11,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-10-15 01:24:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:24:11,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:11,273 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-15 01:24:11,273 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2093661207, now seen corresponding path program 1 times [2019-10-15 01:24:11,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:11,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810537540] [2019-10-15 01:24:11,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:11,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:11,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:11,494 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-15 01:24:11,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810537540] [2019-10-15 01:24:11,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:11,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:11,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033839958] [2019-10-15 01:24:11,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:11,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:11,498 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 7 states. [2019-10-15 01:24:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:12,773 INFO L93 Difference]: Finished difference Result 537 states and 746 transitions. [2019-10-15 01:24:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:12,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:24:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:12,779 INFO L225 Difference]: With dead ends: 537 [2019-10-15 01:24:12,779 INFO L226 Difference]: Without dead ends: 323 [2019-10-15 01:24:12,781 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-15 01:24:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-15 01:24:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-10-15 01:24:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-15 01:24:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-10-15 01:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 94 [2019-10-15 01:24:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:12,814 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-10-15 01:24:12,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-10-15 01:24:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:24:12,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:12,817 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-15 01:24:12,817 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 130349043, now seen corresponding path program 1 times [2019-10-15 01:24:12,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:12,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336541473] [2019-10-15 01:24:12,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:13,012 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-15 01:24:13,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336541473] [2019-10-15 01:24:13,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:13,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:13,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096694014] [2019-10-15 01:24:13,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:13,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:13,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:13,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:13,015 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 7 states. [2019-10-15 01:24:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,173 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2019-10-15 01:24:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:14,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:24:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,177 INFO L225 Difference]: With dead ends: 543 [2019-10-15 01:24:14,177 INFO L226 Difference]: Without dead ends: 326 [2019-10-15 01:24:14,178 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-15 01:24:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-15 01:24:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2019-10-15 01:24:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-15 01:24:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-10-15 01:24:14,202 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 95 [2019-10-15 01:24:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,203 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-10-15 01:24:14,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-10-15 01:24:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:14,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,206 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-15 01:24:14,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1810109727, now seen corresponding path program 1 times [2019-10-15 01:24:14,207 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297515456] [2019-10-15 01:24:14,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,286 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-15 01:24:14,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297515456] [2019-10-15 01:24:14,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:14,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674015734] [2019-10-15 01:24:14,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:14,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:14,289 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 3 states. [2019-10-15 01:24:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,334 INFO L93 Difference]: Finished difference Result 773 states and 1078 transitions. [2019-10-15 01:24:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:14,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,339 INFO L225 Difference]: With dead ends: 773 [2019-10-15 01:24:14,340 INFO L226 Difference]: Without dead ends: 556 [2019-10-15 01:24:14,341 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-15 01:24:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-15 01:24:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 538. [2019-10-15 01:24:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-15 01:24:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 746 transitions. [2019-10-15 01:24:14,382 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 746 transitions. Word has length 97 [2019-10-15 01:24:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,382 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 746 transitions. [2019-10-15 01:24:14,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 746 transitions. [2019-10-15 01:24:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:14,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,385 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-15 01:24:14,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1438423074, now seen corresponding path program 1 times [2019-10-15 01:24:14,386 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108888978] [2019-10-15 01:24:14,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:14,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108888978] [2019-10-15 01:24:14,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:14,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394795816] [2019-10-15 01:24:14,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:14,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:14,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:14,465 INFO L87 Difference]: Start difference. First operand 538 states and 746 transitions. Second operand 3 states. [2019-10-15 01:24:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,498 INFO L93 Difference]: Finished difference Result 929 states and 1310 transitions. [2019-10-15 01:24:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:14,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:24:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,502 INFO L225 Difference]: With dead ends: 929 [2019-10-15 01:24:14,502 INFO L226 Difference]: Without dead ends: 538 [2019-10-15 01:24:14,504 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-15 01:24:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-15 01:24:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-10-15 01:24:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-15 01:24:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 745 transitions. [2019-10-15 01:24:14,541 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 745 transitions. Word has length 98 [2019-10-15 01:24:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,542 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 745 transitions. [2019-10-15 01:24:14,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 745 transitions. [2019-10-15 01:24:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:14,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,544 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-15 01:24:14,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash 737358496, now seen corresponding path program 1 times [2019-10-15 01:24:14,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247722741] [2019-10-15 01:24:14,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,615 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-15 01:24:14,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247722741] [2019-10-15 01:24:14,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:14,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492509685] [2019-10-15 01:24:14,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:14,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:14,618 INFO L87 Difference]: Start difference. First operand 538 states and 745 transitions. Second operand 3 states. [2019-10-15 01:24:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,693 INFO L93 Difference]: Finished difference Result 1171 states and 1643 transitions. [2019-10-15 01:24:14,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:14,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:24:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,701 INFO L225 Difference]: With dead ends: 1171 [2019-10-15 01:24:14,702 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:24:14,706 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-15 01:24:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:24:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-10-15 01:24:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-15 01:24:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1010 transitions. [2019-10-15 01:24:14,778 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1010 transitions. Word has length 98 [2019-10-15 01:24:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,779 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1010 transitions. [2019-10-15 01:24:14,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1010 transitions. [2019-10-15 01:24:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:14,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,783 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-15 01:24:14,783 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -638890142, now seen corresponding path program 1 times [2019-10-15 01:24:14,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676958624] [2019-10-15 01:24:14,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,970 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-15 01:24:14,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676958624] [2019-10-15 01:24:14,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:14,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927545989] [2019-10-15 01:24:14,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:14,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:14,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:14,974 INFO L87 Difference]: Start difference. First operand 724 states and 1010 transitions. Second operand 4 states. [2019-10-15 01:24:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,048 INFO L93 Difference]: Finished difference Result 1312 states and 1857 transitions. [2019-10-15 01:24:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-15 01:24:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,054 INFO L225 Difference]: With dead ends: 1312 [2019-10-15 01:24:15,054 INFO L226 Difference]: Without dead ends: 739 [2019-10-15 01:24:15,057 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-15 01:24:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-15 01:24:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-10-15 01:24:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-15 01:24:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1022 transitions. [2019-10-15 01:24:15,107 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1022 transitions. Word has length 98 [2019-10-15 01:24:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:15,108 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1022 transitions. [2019-10-15 01:24:15,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1022 transitions. [2019-10-15 01:24:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:24:15,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:15,111 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-15 01:24:15,111 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash -397676862, now seen corresponding path program 1 times [2019-10-15 01:24:15,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:15,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883107265] [2019-10-15 01:24:15,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:15,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883107265] [2019-10-15 01:24:15,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:15,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:15,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496048438] [2019-10-15 01:24:15,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:15,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:15,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:15,201 INFO L87 Difference]: Start difference. First operand 739 states and 1022 transitions. Second operand 4 states. [2019-10-15 01:24:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,280 INFO L93 Difference]: Finished difference Result 1342 states and 1890 transitions. [2019-10-15 01:24:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:15,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 01:24:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,286 INFO L225 Difference]: With dead ends: 1342 [2019-10-15 01:24:15,286 INFO L226 Difference]: Without dead ends: 754 [2019-10-15 01:24:15,289 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-15 01:24:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-15 01:24:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-15 01:24:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-15 01:24:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1034 transitions. [2019-10-15 01:24:15,332 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1034 transitions. Word has length 106 [2019-10-15 01:24:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:15,332 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1034 transitions. [2019-10-15 01:24:15,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1034 transitions. [2019-10-15 01:24:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:24:15,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:15,335 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-15 01:24:15,335 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1572879564, now seen corresponding path program 1 times [2019-10-15 01:24:15,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:15,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320756641] [2019-10-15 01:24:15,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:15,414 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-15 01:24:15,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320756641] [2019-10-15 01:24:15,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:15,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:15,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934952809] [2019-10-15 01:24:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:15,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:15,416 INFO L87 Difference]: Start difference. First operand 754 states and 1034 transitions. Second operand 4 states. [2019-10-15 01:24:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,485 INFO L93 Difference]: Finished difference Result 1369 states and 1902 transitions. [2019-10-15 01:24:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:15,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:24:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,491 INFO L225 Difference]: With dead ends: 1369 [2019-10-15 01:24:15,491 INFO L226 Difference]: Without dead ends: 766 [2019-10-15 01:24:15,494 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-15 01:24:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-10-15 01:24:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-10-15 01:24:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-15 01:24:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1043 transitions. [2019-10-15 01:24:15,546 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1043 transitions. Word has length 114 [2019-10-15 01:24:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:15,547 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1043 transitions. [2019-10-15 01:24:15,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1043 transitions. [2019-10-15 01:24:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:24:15,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:15,551 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-15 01:24:15,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -156798744, now seen corresponding path program 1 times [2019-10-15 01:24:15,552 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:15,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027904730] [2019-10-15 01:24:15,552 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:15,654 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-15 01:24:15,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027904730] [2019-10-15 01:24:15,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:15,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:15,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020594749] [2019-10-15 01:24:15,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:15,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:15,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:15,657 INFO L87 Difference]: Start difference. First operand 766 states and 1043 transitions. Second operand 4 states. [2019-10-15 01:24:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,758 INFO L93 Difference]: Finished difference Result 1396 states and 1932 transitions. [2019-10-15 01:24:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:15,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:24:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,765 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:24:15,765 INFO L226 Difference]: Without dead ends: 781 [2019-10-15 01:24:15,768 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-15 01:24:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-15 01:24:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-10-15 01:24:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-15 01:24:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1055 transitions. [2019-10-15 01:24:15,817 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1055 transitions. Word has length 114 [2019-10-15 01:24:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:15,817 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1055 transitions. [2019-10-15 01:24:15,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1055 transitions. [2019-10-15 01:24:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:24:15,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:15,824 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-15 01:24:15,824 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1699235052, now seen corresponding path program 1 times [2019-10-15 01:24:15,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:15,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37466991] [2019-10-15 01:24:15,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:15,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:15,937 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-15 01:24:15,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37466991] [2019-10-15 01:24:15,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:15,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:15,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060399761] [2019-10-15 01:24:15,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:15,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:15,940 INFO L87 Difference]: Start difference. First operand 781 states and 1055 transitions. Second operand 4 states. [2019-10-15 01:24:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:16,007 INFO L93 Difference]: Finished difference Result 1429 states and 1953 transitions. [2019-10-15 01:24:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:16,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:24:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:16,014 INFO L225 Difference]: With dead ends: 1429 [2019-10-15 01:24:16,014 INFO L226 Difference]: Without dead ends: 799 [2019-10-15 01:24:16,017 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-15 01:24:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-15 01:24:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2019-10-15 01:24:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-15 01:24:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1070 transitions. [2019-10-15 01:24:16,062 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1070 transitions. Word has length 122 [2019-10-15 01:24:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:16,063 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1070 transitions. [2019-10-15 01:24:16,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1070 transitions. [2019-10-15 01:24:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:24:16,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:16,066 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-15 01:24:16,066 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 820674453, now seen corresponding path program 1 times [2019-10-15 01:24:16,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:16,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770475128] [2019-10-15 01:24:16,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:16,259 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-15 01:24:16,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770475128] [2019-10-15 01:24:16,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:16,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:16,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642711276] [2019-10-15 01:24:16,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:16,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:16,262 INFO L87 Difference]: Start difference. First operand 799 states and 1070 transitions. Second operand 10 states. [2019-10-15 01:24:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:19,125 INFO L93 Difference]: Finished difference Result 2091 states and 2782 transitions. [2019-10-15 01:24:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:19,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-10-15 01:24:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:19,138 INFO L225 Difference]: With dead ends: 2091 [2019-10-15 01:24:19,138 INFO L226 Difference]: Without dead ends: 1434 [2019-10-15 01:24:19,141 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-15 01:24:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-10-15 01:24:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1337. [2019-10-15 01:24:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-15 01:24:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1760 transitions. [2019-10-15 01:24:19,227 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1760 transitions. Word has length 127 [2019-10-15 01:24:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:19,228 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1760 transitions. [2019-10-15 01:24:19,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1760 transitions. [2019-10-15 01:24:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:24:19,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:19,231 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-15 01:24:19,232 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -191192024, now seen corresponding path program 1 times [2019-10-15 01:24:19,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:19,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015079574] [2019-10-15 01:24:19,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:19,342 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-15 01:24:19,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015079574] [2019-10-15 01:24:19,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:19,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:19,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926452923] [2019-10-15 01:24:19,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:19,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:19,345 INFO L87 Difference]: Start difference. First operand 1337 states and 1760 transitions. Second operand 4 states. [2019-10-15 01:24:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:19,433 INFO L93 Difference]: Finished difference Result 2426 states and 3213 transitions. [2019-10-15 01:24:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:19,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-15 01:24:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:19,448 INFO L225 Difference]: With dead ends: 2426 [2019-10-15 01:24:19,448 INFO L226 Difference]: Without dead ends: 1349 [2019-10-15 01:24:19,453 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-15 01:24:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-10-15 01:24:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1343. [2019-10-15 01:24:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-10-15 01:24:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1747 transitions. [2019-10-15 01:24:19,524 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1747 transitions. Word has length 129 [2019-10-15 01:24:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:19,525 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1747 transitions. [2019-10-15 01:24:19,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1747 transitions. [2019-10-15 01:24:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:24:19,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:19,528 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-15 01:24:19,528 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1773246243, now seen corresponding path program 1 times [2019-10-15 01:24:19,529 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:19,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521867118] [2019-10-15 01:24:19,529 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,529 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:19,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:19,644 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-15 01:24:19,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521867118] [2019-10-15 01:24:19,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:19,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:19,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346368479] [2019-10-15 01:24:19,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:19,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:19,646 INFO L87 Difference]: Start difference. First operand 1343 states and 1747 transitions. Second operand 9 states. [2019-10-15 01:24:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:21,707 INFO L93 Difference]: Finished difference Result 2767 states and 3573 transitions. [2019-10-15 01:24:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:24:21,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-15 01:24:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:21,718 INFO L225 Difference]: With dead ends: 2767 [2019-10-15 01:24:21,718 INFO L226 Difference]: Without dead ends: 1735 [2019-10-15 01:24:21,723 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-15 01:24:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-10-15 01:24:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1466. [2019-10-15 01:24:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-10-15 01:24:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1881 transitions. [2019-10-15 01:24:21,808 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1881 transitions. Word has length 131 [2019-10-15 01:24:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:21,809 INFO L462 AbstractCegarLoop]: Abstraction has 1466 states and 1881 transitions. [2019-10-15 01:24:21,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1881 transitions. [2019-10-15 01:24:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:24:21,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:21,811 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-15 01:24:21,812 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash 46760133, now seen corresponding path program 1 times [2019-10-15 01:24:21,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:21,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434790452] [2019-10-15 01:24:21,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:21,942 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-15 01:24:21,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434790452] [2019-10-15 01:24:21,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:21,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:24:21,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477946508] [2019-10-15 01:24:21,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:24:21,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:24:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:24:21,945 INFO L87 Difference]: Start difference. First operand 1466 states and 1881 transitions. Second operand 8 states. [2019-10-15 01:24:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:22,069 INFO L93 Difference]: Finished difference Result 1567 states and 2024 transitions. [2019-10-15 01:24:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:22,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-15 01:24:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:22,078 INFO L225 Difference]: With dead ends: 1567 [2019-10-15 01:24:22,079 INFO L226 Difference]: Without dead ends: 1565 [2019-10-15 01:24:22,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:24:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-10-15 01:24:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1487. [2019-10-15 01:24:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-10-15 01:24:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1904 transitions. [2019-10-15 01:24:22,162 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1904 transitions. Word has length 130 [2019-10-15 01:24:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:22,162 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 1904 transitions. [2019-10-15 01:24:22,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:24:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1904 transitions. [2019-10-15 01:24:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:24:22,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:22,165 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-15 01:24:22,165 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash -590455559, now seen corresponding path program 1 times [2019-10-15 01:24:22,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:22,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195336398] [2019-10-15 01:24:22,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:22,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:22,373 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-15 01:24:22,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195336398] [2019-10-15 01:24:22,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:22,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:22,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892515563] [2019-10-15 01:24:22,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:22,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:22,375 INFO L87 Difference]: Start difference. First operand 1487 states and 1904 transitions. Second operand 10 states. [2019-10-15 01:24:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,608 INFO L93 Difference]: Finished difference Result 3893 states and 4953 transitions. [2019-10-15 01:24:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:25,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-10-15 01:24:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,629 INFO L225 Difference]: With dead ends: 3893 [2019-10-15 01:24:25,629 INFO L226 Difference]: Without dead ends: 2759 [2019-10-15 01:24:25,635 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-15 01:24:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-10-15 01:24:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1912. [2019-10-15 01:24:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-10-15 01:24:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2434 transitions. [2019-10-15 01:24:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2434 transitions. Word has length 135 [2019-10-15 01:24:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,800 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 2434 transitions. [2019-10-15 01:24:25,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2434 transitions. [2019-10-15 01:24:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:24:25,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,804 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-15 01:24:25,804 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1460592206, now seen corresponding path program 1 times [2019-10-15 01:24:25,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980675081] [2019-10-15 01:24:25,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,907 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-15 01:24:25,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980675081] [2019-10-15 01:24:25,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:25,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013828749] [2019-10-15 01:24:25,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:25,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,910 INFO L87 Difference]: Start difference. First operand 1912 states and 2434 transitions. Second operand 5 states. [2019-10-15 01:24:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,420 INFO L93 Difference]: Finished difference Result 6600 states and 8502 transitions. [2019-10-15 01:24:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:26,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-15 01:24:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,447 INFO L225 Difference]: With dead ends: 6600 [2019-10-15 01:24:26,447 INFO L226 Difference]: Without dead ends: 4986 [2019-10-15 01:24:26,455 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-15 01:24:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2019-10-15 01:24:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4528. [2019-10-15 01:24:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4528 states. [2019-10-15 01:24:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 5778 transitions. [2019-10-15 01:24:26,790 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 5778 transitions. Word has length 136 [2019-10-15 01:24:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,790 INFO L462 AbstractCegarLoop]: Abstraction has 4528 states and 5778 transitions. [2019-10-15 01:24:26,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 5778 transitions. [2019-10-15 01:24:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:24:26,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,794 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-15 01:24:26,794 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1163137124, now seen corresponding path program 1 times [2019-10-15 01:24:26,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886305974] [2019-10-15 01:24:26,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:27,015 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-15 01:24:27,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886305974] [2019-10-15 01:24:27,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:27,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:27,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937833942] [2019-10-15 01:24:27,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:27,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:27,019 INFO L87 Difference]: Start difference. First operand 4528 states and 5778 transitions. Second operand 9 states. [2019-10-15 01:24:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:28,340 INFO L93 Difference]: Finished difference Result 7998 states and 10296 transitions. [2019-10-15 01:24:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:24:28,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-15 01:24:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:28,365 INFO L225 Difference]: With dead ends: 7998 [2019-10-15 01:24:28,365 INFO L226 Difference]: Without dead ends: 4069 [2019-10-15 01:24:28,378 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-15 01:24:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-10-15 01:24:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 3502. [2019-10-15 01:24:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3502 states. [2019-10-15 01:24:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4460 transitions. [2019-10-15 01:24:28,691 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4460 transitions. Word has length 137 [2019-10-15 01:24:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:28,692 INFO L462 AbstractCegarLoop]: Abstraction has 3502 states and 4460 transitions. [2019-10-15 01:24:28,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4460 transitions. [2019-10-15 01:24:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:28,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:28,696 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-15 01:24:28,697 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -548829752, now seen corresponding path program 1 times [2019-10-15 01:24:28,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:28,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679852361] [2019-10-15 01:24:28,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:28,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:28,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:28,842 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-15 01:24:28,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679852361] [2019-10-15 01:24:28,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:28,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:28,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647600408] [2019-10-15 01:24:28,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:28,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:28,845 INFO L87 Difference]: Start difference. First operand 3502 states and 4460 transitions. Second operand 9 states. [2019-10-15 01:24:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:30,411 INFO L93 Difference]: Finished difference Result 7114 states and 9207 transitions. [2019-10-15 01:24:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:24:30,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-10-15 01:24:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:30,435 INFO L225 Difference]: With dead ends: 7114 [2019-10-15 01:24:30,436 INFO L226 Difference]: Without dead ends: 3968 [2019-10-15 01:24:30,447 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-15 01:24:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-10-15 01:24:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3403. [2019-10-15 01:24:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-10-15 01:24:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4335 transitions. [2019-10-15 01:24:30,775 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4335 transitions. Word has length 138 [2019-10-15 01:24:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:30,776 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 4335 transitions. [2019-10-15 01:24:30,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4335 transitions. [2019-10-15 01:24:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:30,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:30,779 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-15 01:24:30,779 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1954100026, now seen corresponding path program 1 times [2019-10-15 01:24:30,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:30,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719018755] [2019-10-15 01:24:30,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:30,870 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-15 01:24:30,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719018755] [2019-10-15 01:24:30,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:30,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:30,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304330013] [2019-10-15 01:24:30,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:30,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:30,877 INFO L87 Difference]: Start difference. First operand 3403 states and 4335 transitions. Second operand 5 states. [2019-10-15 01:24:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:31,512 INFO L93 Difference]: Finished difference Result 10469 states and 13451 transitions. [2019-10-15 01:24:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:31,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-15 01:24:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:31,546 INFO L225 Difference]: With dead ends: 10469 [2019-10-15 01:24:31,546 INFO L226 Difference]: Without dead ends: 7583 [2019-10-15 01:24:31,557 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-15 01:24:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-10-15 01:24:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5220. [2019-10-15 01:24:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-10-15 01:24:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6641 transitions. [2019-10-15 01:24:31,892 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6641 transitions. Word has length 139 [2019-10-15 01:24:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:31,893 INFO L462 AbstractCegarLoop]: Abstraction has 5220 states and 6641 transitions. [2019-10-15 01:24:31,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6641 transitions. [2019-10-15 01:24:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:31,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:31,896 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-15 01:24:31,896 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 392021161, now seen corresponding path program 1 times [2019-10-15 01:24:31,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:31,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50739993] [2019-10-15 01:24:31,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:31,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:31,974 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-15 01:24:31,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50739993] [2019-10-15 01:24:31,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:31,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:31,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125493281] [2019-10-15 01:24:31,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:31,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:31,977 INFO L87 Difference]: Start difference. First operand 5220 states and 6641 transitions. Second operand 5 states. [2019-10-15 01:24:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:32,791 INFO L93 Difference]: Finished difference Result 12108 states and 15464 transitions. [2019-10-15 01:24:32,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:32,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-15 01:24:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:32,827 INFO L225 Difference]: With dead ends: 12108 [2019-10-15 01:24:32,828 INFO L226 Difference]: Without dead ends: 7544 [2019-10-15 01:24:32,842 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-15 01:24:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-10-15 01:24:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6994. [2019-10-15 01:24:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-10-15 01:24:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8852 transitions. [2019-10-15 01:24:33,273 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8852 transitions. Word has length 139 [2019-10-15 01:24:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:33,273 INFO L462 AbstractCegarLoop]: Abstraction has 6994 states and 8852 transitions. [2019-10-15 01:24:33,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8852 transitions. [2019-10-15 01:24:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:33,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:33,278 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-15 01:24:33,278 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003468, now seen corresponding path program 1 times [2019-10-15 01:24:33,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:33,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859071710] [2019-10-15 01:24:33,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:33,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:33,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:33,334 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-15 01:24:33,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859071710] [2019-10-15 01:24:33,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:33,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:33,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744101152] [2019-10-15 01:24:33,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:33,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:33,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:33,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:33,338 INFO L87 Difference]: Start difference. First operand 6994 states and 8852 transitions. Second operand 3 states. [2019-10-15 01:24:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:33,988 INFO L93 Difference]: Finished difference Result 13467 states and 17115 transitions. [2019-10-15 01:24:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:33,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-15 01:24:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:34,015 INFO L225 Difference]: With dead ends: 13467 [2019-10-15 01:24:34,015 INFO L226 Difference]: Without dead ends: 7063 [2019-10-15 01:24:34,031 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-15 01:24:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-10-15 01:24:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7000. [2019-10-15 01:24:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2019-10-15 01:24:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 8858 transitions. [2019-10-15 01:24:34,463 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 8858 transitions. Word has length 140 [2019-10-15 01:24:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:34,463 INFO L462 AbstractCegarLoop]: Abstraction has 7000 states and 8858 transitions. [2019-10-15 01:24:34,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 8858 transitions. [2019-10-15 01:24:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:24:34,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:34,468 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-15 01:24:34,468 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:34,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1697402299, now seen corresponding path program 1 times [2019-10-15 01:24:34,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:34,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585814992] [2019-10-15 01:24:34,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:34,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:34,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585814992] [2019-10-15 01:24:34,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:34,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:24:34,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182445886] [2019-10-15 01:24:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:24:34,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:34,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:24:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:34,787 INFO L87 Difference]: Start difference. First operand 7000 states and 8858 transitions. Second operand 12 states. [2019-10-15 01:24:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:38,378 INFO L93 Difference]: Finished difference Result 14120 states and 17897 transitions. [2019-10-15 01:24:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:24:38,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-10-15 01:24:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:38,407 INFO L225 Difference]: With dead ends: 14120 [2019-10-15 01:24:38,408 INFO L226 Difference]: Without dead ends: 7279 [2019-10-15 01:24:38,425 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-15 01:24:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7279 states. [2019-10-15 01:24:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7279 to 7058. [2019-10-15 01:24:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7058 states. [2019-10-15 01:24:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 8922 transitions. [2019-10-15 01:24:39,037 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 8922 transitions. Word has length 141 [2019-10-15 01:24:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,038 INFO L462 AbstractCegarLoop]: Abstraction has 7058 states and 8922 transitions. [2019-10-15 01:24:39,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:24:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 8922 transitions. [2019-10-15 01:24:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:24:39,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,042 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-15 01:24:39,042 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1725902589, now seen corresponding path program 1 times [2019-10-15 01:24:39,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902813590] [2019-10-15 01:24:39,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat