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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:51:47,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:51:47,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:51:47,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:51:47,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:51:47,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:51:47,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:51:47,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:51:47,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:51:47,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:51:47,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:51:47,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:51:47,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:51:47,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:51:47,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:51:47,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:51:47,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:51:47,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:51:47,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:51:47,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:51:47,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:51:47,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:51:47,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:51:47,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:51:47,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:51:47,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:51:47,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:51:47,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:51:47,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:51:47,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:51:47,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:51:47,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:51:47,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:51:47,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:51:47,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:51:47,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:51:47,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:51:47,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:51:47,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:51:47,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:51:47,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:51:47,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:51:47,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:51:47,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:51:47,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:51:47,092 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:51:47,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:51:47,093 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:51:47,093 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:51:47,093 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:51:47,093 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:51:47,094 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:51:47,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:51:47,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:51:47,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:51:47,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:51:47,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:51:47,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:51:47,097 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:51:47,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:51:47,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:51:47,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:51:47,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:51:47,098 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:51:47,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:51:47,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:51:47,099 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:51:47,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:51:47,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:51:47,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:51:47,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:51:47,160 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:51:47,161 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-09-10 03:51:47,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee51a8d5/7d685d0f0279487fad2ad4c5041b043a/FLAG21b58b530 [2019-09-10 03:51:47,852 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:51:47,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-09-10 03:51:47,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee51a8d5/7d685d0f0279487fad2ad4c5041b043a/FLAG21b58b530 [2019-09-10 03:51:48,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee51a8d5/7d685d0f0279487fad2ad4c5041b043a [2019-09-10 03:51:48,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:51:48,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:51:48,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:51:48,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:51:48,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:51:48,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d10ee34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48, skipping insertion in model container [2019-09-10 03:51:48,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,155 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:51:48,218 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:51:48,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:51:48,605 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:51:48,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:51:48,732 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:51:48,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48 WrapperNode [2019-09-10 03:51:48,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:51:48,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:51:48,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:51:48,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:51:48,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (1/1) ... [2019-09-10 03:51:48,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:51:48,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:51:48,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:51:48,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:51:48,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (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-09-10 03:51:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:51:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:51:48,885 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-09-10 03:51:48,886 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-09-10 03:51:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:51:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-09-10 03:51:48,887 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-09-10 03:51:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-09-10 03:51:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-09-10 03:51:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-09-10 03:51:48,889 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:51:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:51:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:51:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:51:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:51:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-09-10 03:51:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-09-10 03:51:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:51:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-09-10 03:51:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-09-10 03:51:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-09-10 03:51:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-09-10 03:51:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-09-10 03:51:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:51:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:51:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:51:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:51:49,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:51:49,764 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 03:51:49,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:51:49 BoogieIcfgContainer [2019-09-10 03:51:49,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:51:49,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:51:49,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:51:49,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:51:49,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:51:48" (1/3) ... [2019-09-10 03:51:49,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2085d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:51:49, skipping insertion in model container [2019-09-10 03:51:49,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:51:48" (2/3) ... [2019-09-10 03:51:49,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2085d1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:51:49, skipping insertion in model container [2019-09-10 03:51:49,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:51:49" (3/3) ... [2019-09-10 03:51:49,776 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-09-10 03:51:49,788 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:51:49,798 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:51:49,818 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:51:49,849 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:51:49,850 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:51:49,850 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:51:49,850 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:51:49,851 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:51:49,851 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:51:49,851 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:51:49,851 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:51:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-09-10 03:51:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 03:51:49,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:49,899 INFO L399 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-09-10 03:51:49,902 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash -512765460, now seen corresponding path program 1 times [2019-09-10 03:51:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:49,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:50,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:50,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:50,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:50,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:50,450 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2019-09-10 03:51:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:50,552 INFO L93 Difference]: Finished difference Result 240 states and 343 transitions. [2019-09-10 03:51:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:50,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-10 03:51:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:50,579 INFO L225 Difference]: With dead ends: 240 [2019-09-10 03:51:50,579 INFO L226 Difference]: Without dead ends: 232 [2019-09-10 03:51:50,582 INFO L628 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-09-10 03:51:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-10 03:51:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-10 03:51:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-10 03:51:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-09-10 03:51:50,651 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 65 [2019-09-10 03:51:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:50,652 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-09-10 03:51:50,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-09-10 03:51:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 03:51:50,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:50,657 INFO L399 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-09-10 03:51:50,657 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1221172995, now seen corresponding path program 1 times [2019-09-10 03:51:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:50,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:50,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:50,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:50,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:50,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:50,857 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 4 states. [2019-09-10 03:51:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:50,957 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2019-09-10 03:51:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:50,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-10 03:51:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:50,962 INFO L225 Difference]: With dead ends: 236 [2019-09-10 03:51:50,962 INFO L226 Difference]: Without dead ends: 236 [2019-09-10 03:51:50,963 INFO L628 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-09-10 03:51:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-10 03:51:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-09-10 03:51:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-10 03:51:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-09-10 03:51:50,987 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 76 [2019-09-10 03:51:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:50,988 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-09-10 03:51:50,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-09-10 03:51:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:51:50,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:50,993 INFO L399 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-09-10 03:51:50,993 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2093661207, now seen corresponding path program 1 times [2019-09-10 03:51:50,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:50,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:50,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:51,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:51,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:51:51,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:51,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:51:51,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:51:51,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:51:51,161 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 7 states. [2019-09-10 03:51:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:52,643 INFO L93 Difference]: Finished difference Result 323 states and 440 transitions. [2019-09-10 03:51:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:51:52,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-10 03:51:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:52,649 INFO L225 Difference]: With dead ends: 323 [2019-09-10 03:51:52,650 INFO L226 Difference]: Without dead ends: 323 [2019-09-10 03:51:52,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:51:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-10 03:51:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-09-10 03:51:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 03:51:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-09-10 03:51:52,680 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 94 [2019-09-10 03:51:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:52,685 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-09-10 03:51:52,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:51:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-09-10 03:51:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:51:52,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:52,693 INFO L399 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-09-10 03:51:52,693 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash 130349043, now seen corresponding path program 1 times [2019-09-10 03:51:52,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:52,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:52,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:51:52,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:52,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:51:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:51:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:51:52,854 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 7 states. [2019-09-10 03:51:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:54,098 INFO L93 Difference]: Finished difference Result 326 states and 444 transitions. [2019-09-10 03:51:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:51:54,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 03:51:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:54,102 INFO L225 Difference]: With dead ends: 326 [2019-09-10 03:51:54,102 INFO L226 Difference]: Without dead ends: 326 [2019-09-10 03:51:54,103 INFO L628 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-09-10 03:51:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-10 03:51:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2019-09-10 03:51:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 03:51:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-09-10 03:51:54,124 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 95 [2019-09-10 03:51:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:54,125 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-09-10 03:51:54,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:51:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-09-10 03:51:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:51:54,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:54,128 INFO L399 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-09-10 03:51:54,128 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1810109727, now seen corresponding path program 1 times [2019-09-10 03:51:54,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:54,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:54,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:54,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:54,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:51:54,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:54,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:51:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:51:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:51:54,243 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 3 states. [2019-09-10 03:51:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:54,276 INFO L93 Difference]: Finished difference Result 556 states and 767 transitions. [2019-09-10 03:51:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:51:54,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 03:51:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:54,283 INFO L225 Difference]: With dead ends: 556 [2019-09-10 03:51:54,284 INFO L226 Difference]: Without dead ends: 556 [2019-09-10 03:51:54,284 INFO L628 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-09-10 03:51:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-10 03:51:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 538. [2019-09-10 03:51:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-10 03:51:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 746 transitions. [2019-09-10 03:51:54,339 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 746 transitions. Word has length 97 [2019-09-10 03:51:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:54,340 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 746 transitions. [2019-09-10 03:51:54,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:51:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 746 transitions. [2019-09-10 03:51:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 03:51:54,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:54,343 INFO L399 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-09-10 03:51:54,344 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1438423074, now seen corresponding path program 1 times [2019-09-10 03:51:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:54,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:54,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:54,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:54,458 INFO L87 Difference]: Start difference. First operand 538 states and 746 transitions. Second operand 4 states. [2019-09-10 03:51:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:54,501 INFO L93 Difference]: Finished difference Result 548 states and 754 transitions. [2019-09-10 03:51:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:54,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 03:51:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:54,508 INFO L225 Difference]: With dead ends: 548 [2019-09-10 03:51:54,509 INFO L226 Difference]: Without dead ends: 548 [2019-09-10 03:51:54,509 INFO L628 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-09-10 03:51:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-10 03:51:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-09-10 03:51:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-10 03:51:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 754 transitions. [2019-09-10 03:51:54,539 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 754 transitions. Word has length 98 [2019-09-10 03:51:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:54,540 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 754 transitions. [2019-09-10 03:51:54,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 754 transitions. [2019-09-10 03:51:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 03:51:54,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:54,543 INFO L399 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] [2019-09-10 03:51:54,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash 300651553, now seen corresponding path program 1 times [2019-09-10 03:51:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:54,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:51:54,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:54,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:51:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:51:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:51:54,618 INFO L87 Difference]: Start difference. First operand 548 states and 754 transitions. Second operand 3 states. [2019-09-10 03:51:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:54,650 INFO L93 Difference]: Finished difference Result 566 states and 773 transitions. [2019-09-10 03:51:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:51:54,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 03:51:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:54,655 INFO L225 Difference]: With dead ends: 566 [2019-09-10 03:51:54,655 INFO L226 Difference]: Without dead ends: 566 [2019-09-10 03:51:54,655 INFO L628 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-09-10 03:51:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-10 03:51:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 548. [2019-09-10 03:51:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-10 03:51:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 752 transitions. [2019-09-10 03:51:54,679 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 752 transitions. Word has length 107 [2019-09-10 03:51:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:54,680 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 752 transitions. [2019-09-10 03:51:54,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:51:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 752 transitions. [2019-09-10 03:51:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 03:51:54,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:54,682 INFO L399 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-09-10 03:51:54,683 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:54,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:54,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1973974914, now seen corresponding path program 1 times [2019-09-10 03:51:54,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:54,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:54,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:54,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:54,792 INFO L87 Difference]: Start difference. First operand 548 states and 752 transitions. Second operand 4 states. [2019-09-10 03:51:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:54,850 INFO L93 Difference]: Finished difference Result 558 states and 760 transitions. [2019-09-10 03:51:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:54,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 03:51:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:54,855 INFO L225 Difference]: With dead ends: 558 [2019-09-10 03:51:54,855 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 03:51:54,856 INFO L628 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-09-10 03:51:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 03:51:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-09-10 03:51:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-10 03:51:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 760 transitions. [2019-09-10 03:51:54,887 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 760 transitions. Word has length 106 [2019-09-10 03:51:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:54,888 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 760 transitions. [2019-09-10 03:51:54,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 760 transitions. [2019-09-10 03:51:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 03:51:54,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:54,893 INFO L399 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-09-10 03:51:54,893 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1567098252, now seen corresponding path program 1 times [2019-09-10 03:51:54,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:54,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:55,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:55,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:55,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:55,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:55,066 INFO L87 Difference]: Start difference. First operand 558 states and 760 transitions. Second operand 4 states. [2019-09-10 03:51:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:55,130 INFO L93 Difference]: Finished difference Result 566 states and 766 transitions. [2019-09-10 03:51:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:55,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 03:51:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:55,136 INFO L225 Difference]: With dead ends: 566 [2019-09-10 03:51:55,137 INFO L226 Difference]: Without dead ends: 566 [2019-09-10 03:51:55,138 INFO L628 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-09-10 03:51:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-10 03:51:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-09-10 03:51:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-10 03:51:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 766 transitions. [2019-09-10 03:51:55,176 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 766 transitions. Word has length 114 [2019-09-10 03:51:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:55,186 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 766 transitions. [2019-09-10 03:51:55,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 766 transitions. [2019-09-10 03:51:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 03:51:55,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:55,193 INFO L399 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-09-10 03:51:55,194 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -162580056, now seen corresponding path program 1 times [2019-09-10 03:51:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:55,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:55,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:55,400 INFO L87 Difference]: Start difference. First operand 566 states and 766 transitions. Second operand 4 states. [2019-09-10 03:51:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:55,448 INFO L93 Difference]: Finished difference Result 576 states and 774 transitions. [2019-09-10 03:51:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:55,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 03:51:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:55,452 INFO L225 Difference]: With dead ends: 576 [2019-09-10 03:51:55,452 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:51:55,453 INFO L628 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-09-10 03:51:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:51:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 03:51:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 03:51:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 774 transitions. [2019-09-10 03:51:55,477 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 774 transitions. Word has length 114 [2019-09-10 03:51:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:55,478 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 774 transitions. [2019-09-10 03:51:55,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 774 transitions. [2019-09-10 03:51:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 03:51:55,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:55,481 INFO L399 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-09-10 03:51:55,481 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2012958124, now seen corresponding path program 1 times [2019-09-10 03:51:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:51:55,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:55,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:51:55,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:55,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:51:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:51:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:51:55,568 INFO L87 Difference]: Start difference. First operand 576 states and 774 transitions. Second operand 3 states. [2019-09-10 03:51:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:55,584 INFO L93 Difference]: Finished difference Result 577 states and 774 transitions. [2019-09-10 03:51:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:51:55,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 03:51:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:55,590 INFO L225 Difference]: With dead ends: 577 [2019-09-10 03:51:55,590 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:51:55,591 INFO L628 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-09-10 03:51:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:51:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 03:51:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 03:51:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 773 transitions. [2019-09-10 03:51:55,616 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 773 transitions. Word has length 122 [2019-09-10 03:51:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:55,616 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 773 transitions. [2019-09-10 03:51:55,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:51:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 773 transitions. [2019-09-10 03:51:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 03:51:55,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:55,620 INFO L399 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-09-10 03:51:55,620 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1438003670, now seen corresponding path program 1 times [2019-09-10 03:51:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:51:55,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:51:55,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:55,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:51:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:51:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:51:55,714 INFO L87 Difference]: Start difference. First operand 576 states and 773 transitions. Second operand 3 states. [2019-09-10 03:51:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:55,737 INFO L93 Difference]: Finished difference Result 838 states and 1122 transitions. [2019-09-10 03:51:55,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:51:55,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 03:51:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:55,743 INFO L225 Difference]: With dead ends: 838 [2019-09-10 03:51:55,743 INFO L226 Difference]: Without dead ends: 787 [2019-09-10 03:51:55,743 INFO L628 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-09-10 03:51:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-10 03:51:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 781. [2019-09-10 03:51:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-10 03:51:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1053 transitions. [2019-09-10 03:51:55,775 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1053 transitions. Word has length 122 [2019-09-10 03:51:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:55,777 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1053 transitions. [2019-09-10 03:51:55,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:51:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1053 transitions. [2019-09-10 03:51:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 03:51:55,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:55,781 INFO L399 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-09-10 03:51:55,782 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1699235052, now seen corresponding path program 1 times [2019-09-10 03:51:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:55,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:51:55,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:55,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:55,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:55,918 INFO L87 Difference]: Start difference. First operand 781 states and 1053 transitions. Second operand 4 states. [2019-09-10 03:51:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:55,960 INFO L93 Difference]: Finished difference Result 799 states and 1068 transitions. [2019-09-10 03:51:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:55,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-10 03:51:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:55,966 INFO L225 Difference]: With dead ends: 799 [2019-09-10 03:51:55,966 INFO L226 Difference]: Without dead ends: 799 [2019-09-10 03:51:55,966 INFO L628 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-09-10 03:51:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-10 03:51:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2019-09-10 03:51:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-09-10 03:51:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1068 transitions. [2019-09-10 03:51:56,000 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1068 transitions. Word has length 122 [2019-09-10 03:51:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:56,001 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1068 transitions. [2019-09-10 03:51:56,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1068 transitions. [2019-09-10 03:51:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 03:51:56,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:56,004 INFO L399 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-09-10 03:51:56,005 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 820674453, now seen corresponding path program 1 times [2019-09-10 03:51:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:56,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:51:56,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:56,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:51:56,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:56,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:51:56,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:51:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:51:56,277 INFO L87 Difference]: Start difference. First operand 799 states and 1068 transitions. Second operand 10 states. [2019-09-10 03:51:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:59,188 INFO L93 Difference]: Finished difference Result 1443 states and 1886 transitions. [2019-09-10 03:51:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:51:59,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-10 03:51:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:59,202 INFO L225 Difference]: With dead ends: 1443 [2019-09-10 03:51:59,202 INFO L226 Difference]: Without dead ends: 1434 [2019-09-10 03:51:59,204 INFO L628 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-09-10 03:51:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-09-10 03:51:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1337. [2019-09-10 03:51:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-10 03:51:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1753 transitions. [2019-09-10 03:51:59,272 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1753 transitions. Word has length 127 [2019-09-10 03:51:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:59,273 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1753 transitions. [2019-09-10 03:51:59,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:51:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1753 transitions. [2019-09-10 03:51:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 03:51:59,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:59,277 INFO L399 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-09-10 03:51:59,278 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -191192024, now seen corresponding path program 1 times [2019-09-10 03:51:59,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:59,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:59,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:51:59,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:59,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:59,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:59,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:59,414 INFO L87 Difference]: Start difference. First operand 1337 states and 1753 transitions. Second operand 4 states. [2019-09-10 03:51:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:59,464 INFO L93 Difference]: Finished difference Result 1349 states and 1747 transitions. [2019-09-10 03:51:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:59,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 03:51:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:59,472 INFO L225 Difference]: With dead ends: 1349 [2019-09-10 03:51:59,473 INFO L226 Difference]: Without dead ends: 1349 [2019-09-10 03:51:59,475 INFO L628 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-09-10 03:51:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-09-10 03:51:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1343. [2019-09-10 03:51:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-09-10 03:51:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1740 transitions. [2019-09-10 03:51:59,525 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1740 transitions. Word has length 129 [2019-09-10 03:51:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:59,526 INFO L475 AbstractCegarLoop]: Abstraction has 1343 states and 1740 transitions. [2019-09-10 03:51:59,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1740 transitions. [2019-09-10 03:51:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 03:51:59,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:59,529 INFO L399 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-09-10 03:51:59,529 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:59,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1773246243, now seen corresponding path program 1 times [2019-09-10 03:51:59,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:59,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:59,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:51:59,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:59,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:51:59,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:59,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:51:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:51:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:51:59,674 INFO L87 Difference]: Start difference. First operand 1343 states and 1740 transitions. Second operand 9 states. [2019-09-10 03:52:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:01,715 INFO L93 Difference]: Finished difference Result 1735 states and 2217 transitions. [2019-09-10 03:52:01,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:52:01,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-10 03:52:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:01,729 INFO L225 Difference]: With dead ends: 1735 [2019-09-10 03:52:01,729 INFO L226 Difference]: Without dead ends: 1735 [2019-09-10 03:52:01,730 INFO L628 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-09-10 03:52:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-09-10 03:52:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1466. [2019-09-10 03:52:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-09-10 03:52:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1875 transitions. [2019-09-10 03:52:01,806 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1875 transitions. Word has length 131 [2019-09-10 03:52:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:01,807 INFO L475 AbstractCegarLoop]: Abstraction has 1466 states and 1875 transitions. [2019-09-10 03:52:01,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:52:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1875 transitions. [2019-09-10 03:52:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 03:52:01,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:01,811 INFO L399 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-09-10 03:52:01,811 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 46760133, now seen corresponding path program 1 times [2019-09-10 03:52:01,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:01,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:01,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:52:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:52:01,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:01,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:52:01,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:52:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:52:01,976 INFO L87 Difference]: Start difference. First operand 1466 states and 1875 transitions. Second operand 8 states. [2019-09-10 03:52:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:02,079 INFO L93 Difference]: Finished difference Result 1565 states and 2001 transitions. [2019-09-10 03:52:02,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:52:02,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-09-10 03:52:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:02,090 INFO L225 Difference]: With dead ends: 1565 [2019-09-10 03:52:02,091 INFO L226 Difference]: Without dead ends: 1565 [2019-09-10 03:52:02,091 INFO L628 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-09-10 03:52:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-09-10 03:52:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1487. [2019-09-10 03:52:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-09-10 03:52:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1896 transitions. [2019-09-10 03:52:02,170 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1896 transitions. Word has length 130 [2019-09-10 03:52:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:02,171 INFO L475 AbstractCegarLoop]: Abstraction has 1487 states and 1896 transitions. [2019-09-10 03:52:02,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:52:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1896 transitions. [2019-09-10 03:52:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 03:52:02,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:02,175 INFO L399 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-09-10 03:52:02,175 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash -590455559, now seen corresponding path program 1 times [2019-09-10 03:52:02,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:02,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:02,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:52:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:02,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:52:02,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:52:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:52:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:52:02,385 INFO L87 Difference]: Start difference. First operand 1487 states and 1896 transitions. Second operand 10 states. [2019-09-10 03:52:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:06,410 INFO L93 Difference]: Finished difference Result 2759 states and 3482 transitions. [2019-09-10 03:52:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:52:06,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-09-10 03:52:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:06,424 INFO L225 Difference]: With dead ends: 2759 [2019-09-10 03:52:06,424 INFO L226 Difference]: Without dead ends: 2759 [2019-09-10 03:52:06,425 INFO L628 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-09-10 03:52:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-09-10 03:52:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1818. [2019-09-10 03:52:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2019-09-10 03:52:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2310 transitions. [2019-09-10 03:52:06,494 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2310 transitions. Word has length 135 [2019-09-10 03:52:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:06,495 INFO L475 AbstractCegarLoop]: Abstraction has 1818 states and 2310 transitions. [2019-09-10 03:52:06,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:52:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2310 transitions. [2019-09-10 03:52:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 03:52:06,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:06,497 INFO L399 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-09-10 03:52:06,497 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1460592206, now seen corresponding path program 1 times [2019-09-10 03:52:06,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:06,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:06,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:06,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:06,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:06,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:06,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:06,600 INFO L87 Difference]: Start difference. First operand 1818 states and 2310 transitions. Second operand 5 states. [2019-09-10 03:52:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:06,999 INFO L93 Difference]: Finished difference Result 4703 states and 5985 transitions. [2019-09-10 03:52:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:52:07,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 03:52:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:07,032 INFO L225 Difference]: With dead ends: 4703 [2019-09-10 03:52:07,032 INFO L226 Difference]: Without dead ends: 4703 [2019-09-10 03:52:07,034 INFO L628 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-09-10 03:52:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2019-09-10 03:52:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4142. [2019-09-10 03:52:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2019-09-10 03:52:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 5285 transitions. [2019-09-10 03:52:07,215 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 5285 transitions. Word has length 136 [2019-09-10 03:52:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:07,217 INFO L475 AbstractCegarLoop]: Abstraction has 4142 states and 5285 transitions. [2019-09-10 03:52:07,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 5285 transitions. [2019-09-10 03:52:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 03:52:07,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:07,221 INFO L399 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-09-10 03:52:07,221 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1163137124, now seen corresponding path program 1 times [2019-09-10 03:52:07,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:07,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:07,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:07,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:52:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:52:07,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:07,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:52:07,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:52:07,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:52:07,445 INFO L87 Difference]: Start difference. First operand 4142 states and 5285 transitions. Second operand 9 states. [2019-09-10 03:52:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:08,737 INFO L93 Difference]: Finished difference Result 3861 states and 4949 transitions. [2019-09-10 03:52:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:52:08,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-10 03:52:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:08,763 INFO L225 Difference]: With dead ends: 3861 [2019-09-10 03:52:08,763 INFO L226 Difference]: Without dead ends: 3861 [2019-09-10 03:52:08,764 INFO L628 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-09-10 03:52:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-09-10 03:52:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3502. [2019-09-10 03:52:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3502 states. [2019-09-10 03:52:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4460 transitions. [2019-09-10 03:52:08,881 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4460 transitions. Word has length 137 [2019-09-10 03:52:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:08,881 INFO L475 AbstractCegarLoop]: Abstraction has 3502 states and 4460 transitions. [2019-09-10 03:52:08,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:52:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4460 transitions. [2019-09-10 03:52:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 03:52:08,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:08,885 INFO L399 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-09-10 03:52:08,885 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash -548829752, now seen corresponding path program 1 times [2019-09-10 03:52:08,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:08,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:52:09,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:09,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:52:09,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:09,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:52:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:52:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:52:09,021 INFO L87 Difference]: Start difference. First operand 3502 states and 4460 transitions. Second operand 9 states. [2019-09-10 03:52:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:10,615 INFO L93 Difference]: Finished difference Result 3968 states and 5139 transitions. [2019-09-10 03:52:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:52:10,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-09-10 03:52:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:10,635 INFO L225 Difference]: With dead ends: 3968 [2019-09-10 03:52:10,635 INFO L226 Difference]: Without dead ends: 3968 [2019-09-10 03:52:10,636 INFO L628 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-09-10 03:52:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-09-10 03:52:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3403. [2019-09-10 03:52:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-09-10 03:52:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4335 transitions. [2019-09-10 03:52:10,729 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4335 transitions. Word has length 138 [2019-09-10 03:52:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:10,730 INFO L475 AbstractCegarLoop]: Abstraction has 3403 states and 4335 transitions. [2019-09-10 03:52:10,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:52:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4335 transitions. [2019-09-10 03:52:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 03:52:10,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:10,733 INFO L399 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-09-10 03:52:10,734 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1954100026, now seen corresponding path program 1 times [2019-09-10 03:52:10,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:10,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:10,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:10,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:10,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:10,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:10,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:10,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:10,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:10,821 INFO L87 Difference]: Start difference. First operand 3403 states and 4335 transitions. Second operand 5 states. [2019-09-10 03:52:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:11,142 INFO L93 Difference]: Finished difference Result 7583 states and 9688 transitions. [2019-09-10 03:52:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:52:11,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 03:52:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:11,201 INFO L225 Difference]: With dead ends: 7583 [2019-09-10 03:52:11,201 INFO L226 Difference]: Without dead ends: 7583 [2019-09-10 03:52:11,202 INFO L628 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-09-10 03:52:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-09-10 03:52:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5220. [2019-09-10 03:52:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-09-10 03:52:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6641 transitions. [2019-09-10 03:52:11,362 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6641 transitions. Word has length 139 [2019-09-10 03:52:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:11,362 INFO L475 AbstractCegarLoop]: Abstraction has 5220 states and 6641 transitions. [2019-09-10 03:52:11,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6641 transitions. [2019-09-10 03:52:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 03:52:11,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:11,367 INFO L399 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-09-10 03:52:11,367 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:11,367 INFO L82 PathProgramCache]: Analyzing trace with hash 392021161, now seen corresponding path program 1 times [2019-09-10 03:52:11,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:11,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:11,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:11,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:11,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:11,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:11,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:11,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:11,458 INFO L87 Difference]: Start difference. First operand 5220 states and 6641 transitions. Second operand 5 states. [2019-09-10 03:52:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:11,794 INFO L93 Difference]: Finished difference Result 7544 states and 9555 transitions. [2019-09-10 03:52:11,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:52:11,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 03:52:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:11,819 INFO L225 Difference]: With dead ends: 7544 [2019-09-10 03:52:11,819 INFO L226 Difference]: Without dead ends: 7544 [2019-09-10 03:52:11,820 INFO L628 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-09-10 03:52:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-09-10 03:52:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6994. [2019-09-10 03:52:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-09-10 03:52:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8852 transitions. [2019-09-10 03:52:12,052 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8852 transitions. Word has length 139 [2019-09-10 03:52:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:12,052 INFO L475 AbstractCegarLoop]: Abstraction has 6994 states and 8852 transitions. [2019-09-10 03:52:12,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8852 transitions. [2019-09-10 03:52:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 03:52:12,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:12,057 INFO L399 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-09-10 03:52:12,057 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003468, now seen corresponding path program 1 times [2019-09-10 03:52:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:12,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:12,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:12,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:52:12,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:12,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:52:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:52:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:52:12,109 INFO L87 Difference]: Start difference. First operand 6994 states and 8852 transitions. Second operand 3 states. [2019-09-10 03:52:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:12,201 INFO L93 Difference]: Finished difference Result 7063 states and 8957 transitions. [2019-09-10 03:52:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:52:12,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 03:52:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:12,223 INFO L225 Difference]: With dead ends: 7063 [2019-09-10 03:52:12,223 INFO L226 Difference]: Without dead ends: 7063 [2019-09-10 03:52:12,223 INFO L628 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-09-10 03:52:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-09-10 03:52:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7000. [2019-09-10 03:52:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2019-09-10 03:52:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 8858 transitions. [2019-09-10 03:52:12,369 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 8858 transitions. Word has length 140 [2019-09-10 03:52:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:12,370 INFO L475 AbstractCegarLoop]: Abstraction has 7000 states and 8858 transitions. [2019-09-10 03:52:12,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:52:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 8858 transitions. [2019-09-10 03:52:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:12,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:12,374 INFO L399 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-09-10 03:52:12,374 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1697402299, now seen corresponding path program 1 times [2019-09-10 03:52:12,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:12,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:12,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:12,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:12,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 03:52:12,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:12,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:52:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:52:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:52:12,743 INFO L87 Difference]: Start difference. First operand 7000 states and 8858 transitions. Second operand 12 states. [2019-09-10 03:52:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:16,006 INFO L93 Difference]: Finished difference Result 7285 states and 9214 transitions. [2019-09-10 03:52:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:52:16,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-09-10 03:52:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:16,027 INFO L225 Difference]: With dead ends: 7285 [2019-09-10 03:52:16,028 INFO L226 Difference]: Without dead ends: 7279 [2019-09-10 03:52:16,029 INFO L628 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-09-10 03:52:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7279 states. [2019-09-10 03:52:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7279 to 7058. [2019-09-10 03:52:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7058 states. [2019-09-10 03:52:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 8922 transitions. [2019-09-10 03:52:16,192 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 8922 transitions. Word has length 141 [2019-09-10 03:52:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:16,192 INFO L475 AbstractCegarLoop]: Abstraction has 7058 states and 8922 transitions. [2019-09-10 03:52:16,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:52:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 8922 transitions. [2019-09-10 03:52:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:16,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:16,197 INFO L399 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-09-10 03:52:16,197 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1725902589, now seen corresponding path program 1 times [2019-09-10 03:52:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:16,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:16,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:16,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:16,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:16,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 03:52:16,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:16,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:52:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:52:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:52:16,530 INFO L87 Difference]: Start difference. First operand 7058 states and 8922 transitions. Second operand 12 states. [2019-09-10 03:52:17,027 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-09-10 03:52:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:19,952 INFO L93 Difference]: Finished difference Result 7445 states and 9422 transitions. [2019-09-10 03:52:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:52:19,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-09-10 03:52:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:19,978 INFO L225 Difference]: With dead ends: 7445 [2019-09-10 03:52:19,978 INFO L226 Difference]: Without dead ends: 7435 [2019-09-10 03:52:19,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:52:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2019-09-10 03:52:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7066. [2019-09-10 03:52:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7066 states. [2019-09-10 03:52:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 8932 transitions. [2019-09-10 03:52:20,129 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 8932 transitions. Word has length 141 [2019-09-10 03:52:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:20,129 INFO L475 AbstractCegarLoop]: Abstraction has 7066 states and 8932 transitions. [2019-09-10 03:52:20,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:52:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 8932 transitions. [2019-09-10 03:52:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:20,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:20,134 INFO L399 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-09-10 03:52:20,134 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 950089793, now seen corresponding path program 1 times [2019-09-10 03:52:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:20,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:20,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:20,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 03:52:20,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:20,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:52:20,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:52:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:52:20,595 INFO L87 Difference]: Start difference. First operand 7066 states and 8932 transitions. Second operand 13 states. [2019-09-10 03:52:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:23,426 INFO L93 Difference]: Finished difference Result 7392 states and 9363 transitions. [2019-09-10 03:52:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:52:23,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2019-09-10 03:52:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:23,449 INFO L225 Difference]: With dead ends: 7392 [2019-09-10 03:52:23,449 INFO L226 Difference]: Without dead ends: 7392 [2019-09-10 03:52:23,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:52:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-09-10 03:52:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7088. [2019-09-10 03:52:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7088 states. [2019-09-10 03:52:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 8979 transitions. [2019-09-10 03:52:23,606 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 8979 transitions. Word has length 141 [2019-09-10 03:52:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:23,606 INFO L475 AbstractCegarLoop]: Abstraction has 7088 states and 8979 transitions. [2019-09-10 03:52:23,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:52:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 8979 transitions. [2019-09-10 03:52:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:23,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:23,611 INFO L399 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-09-10 03:52:23,612 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash -192412673, now seen corresponding path program 1 times [2019-09-10 03:52:23,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:23,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:23,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:23,923 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2019-09-10 03:52:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 03:52:24,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:24,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:52:24,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:52:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:52:24,137 INFO L87 Difference]: Start difference. First operand 7088 states and 8979 transitions. Second operand 12 states. [2019-09-10 03:52:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:26,701 INFO L93 Difference]: Finished difference Result 6874 states and 8715 transitions. [2019-09-10 03:52:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:52:26,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-09-10 03:52:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:26,722 INFO L225 Difference]: With dead ends: 6874 [2019-09-10 03:52:26,722 INFO L226 Difference]: Without dead ends: 6860 [2019-09-10 03:52:26,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:52:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2019-09-10 03:52:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 6771. [2019-09-10 03:52:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6771 states. [2019-09-10 03:52:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 8590 transitions. [2019-09-10 03:52:26,853 INFO L78 Accepts]: Start accepts. Automaton has 6771 states and 8590 transitions. Word has length 141 [2019-09-10 03:52:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:26,854 INFO L475 AbstractCegarLoop]: Abstraction has 6771 states and 8590 transitions. [2019-09-10 03:52:26,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:52:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6771 states and 8590 transitions. [2019-09-10 03:52:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:26,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:26,858 INFO L399 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-09-10 03:52:26,858 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash 119974351, now seen corresponding path program 1 times [2019-09-10 03:52:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:26,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:26,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:27,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:27,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 03:52:27,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:27,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:52:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:52:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:52:27,325 INFO L87 Difference]: Start difference. First operand 6771 states and 8590 transitions. Second operand 14 states. [2019-09-10 03:52:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:30,386 INFO L93 Difference]: Finished difference Result 7004 states and 8875 transitions. [2019-09-10 03:52:30,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 03:52:30,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 141 [2019-09-10 03:52:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:30,407 INFO L225 Difference]: With dead ends: 7004 [2019-09-10 03:52:30,408 INFO L226 Difference]: Without dead ends: 7004 [2019-09-10 03:52:30,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:52:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2019-09-10 03:52:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6891. [2019-09-10 03:52:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-09-10 03:52:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 8756 transitions. [2019-09-10 03:52:30,549 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 8756 transitions. Word has length 141 [2019-09-10 03:52:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:30,550 INFO L475 AbstractCegarLoop]: Abstraction has 6891 states and 8756 transitions. [2019-09-10 03:52:30,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:52:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 8756 transitions. [2019-09-10 03:52:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 03:52:30,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:30,554 INFO L399 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-09-10 03:52:30,554 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1007197197, now seen corresponding path program 1 times [2019-09-10 03:52:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:30,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:30,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 03:52:30,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:30,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:52:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:52:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:52:30,850 INFO L87 Difference]: Start difference. First operand 6891 states and 8756 transitions. Second operand 12 states. [2019-09-10 03:52:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:33,101 INFO L93 Difference]: Finished difference Result 6703 states and 8476 transitions. [2019-09-10 03:52:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:52:33,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2019-09-10 03:52:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:33,118 INFO L225 Difference]: With dead ends: 6703 [2019-09-10 03:52:33,119 INFO L226 Difference]: Without dead ends: 6698 [2019-09-10 03:52:33,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:52:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2019-09-10 03:52:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6557. [2019-09-10 03:52:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6557 states. [2019-09-10 03:52:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 8294 transitions. [2019-09-10 03:52:33,259 INFO L78 Accepts]: Start accepts. Automaton has 6557 states and 8294 transitions. Word has length 141 [2019-09-10 03:52:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:33,259 INFO L475 AbstractCegarLoop]: Abstraction has 6557 states and 8294 transitions. [2019-09-10 03:52:33,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:52:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 6557 states and 8294 transitions. [2019-09-10 03:52:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 03:52:33,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:33,263 INFO L399 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, 1] [2019-09-10 03:52:33,264 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 388158071, now seen corresponding path program 1 times [2019-09-10 03:52:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:33,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:33,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:33,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:52:33,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:33,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:52:33,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:52:33,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:52:33,331 INFO L87 Difference]: Start difference. First operand 6557 states and 8294 transitions. Second operand 3 states. [2019-09-10 03:52:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:33,414 INFO L93 Difference]: Finished difference Result 6641 states and 8413 transitions. [2019-09-10 03:52:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:52:33,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 03:52:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:33,432 INFO L225 Difference]: With dead ends: 6641 [2019-09-10 03:52:33,432 INFO L226 Difference]: Without dead ends: 6641 [2019-09-10 03:52:33,433 INFO L628 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-09-10 03:52:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2019-09-10 03:52:33,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 6564. [2019-09-10 03:52:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6564 states. [2019-09-10 03:52:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6564 states to 6564 states and 8301 transitions. [2019-09-10 03:52:33,600 INFO L78 Accepts]: Start accepts. Automaton has 6564 states and 8301 transitions. Word has length 142 [2019-09-10 03:52:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:33,600 INFO L475 AbstractCegarLoop]: Abstraction has 6564 states and 8301 transitions. [2019-09-10 03:52:33,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:52:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6564 states and 8301 transitions. [2019-09-10 03:52:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 03:52:33,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:33,604 INFO L399 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, 1] [2019-09-10 03:52:33,605 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 997073778, now seen corresponding path program 1 times [2019-09-10 03:52:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:33,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:33,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:33,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 03:52:33,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:33,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:52:33,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:52:33,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:52:33,981 INFO L87 Difference]: Start difference. First operand 6564 states and 8301 transitions. Second operand 13 states. [2019-09-10 03:52:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:36,853 INFO L93 Difference]: Finished difference Result 6656 states and 8414 transitions. [2019-09-10 03:52:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 03:52:36,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2019-09-10 03:52:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:36,863 INFO L225 Difference]: With dead ends: 6656 [2019-09-10 03:52:36,864 INFO L226 Difference]: Without dead ends: 6656 [2019-09-10 03:52:36,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:52:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2019-09-10 03:52:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6558. [2019-09-10 03:52:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6558 states. [2019-09-10 03:52:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 8282 transitions. [2019-09-10 03:52:36,995 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 8282 transitions. Word has length 142 [2019-09-10 03:52:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:36,995 INFO L475 AbstractCegarLoop]: Abstraction has 6558 states and 8282 transitions. [2019-09-10 03:52:36,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:52:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 8282 transitions. [2019-09-10 03:52:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 03:52:36,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:36,999 INFO L399 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, 1, 1] [2019-09-10 03:52:36,999 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1215300279, now seen corresponding path program 1 times [2019-09-10 03:52:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:37,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:37,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:52:37,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:37,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:52:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:52:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:52:37,067 INFO L87 Difference]: Start difference. First operand 6558 states and 8282 transitions. Second operand 4 states. [2019-09-10 03:52:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:37,164 INFO L93 Difference]: Finished difference Result 6401 states and 8106 transitions. [2019-09-10 03:52:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:52:37,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-10 03:52:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:37,177 INFO L225 Difference]: With dead ends: 6401 [2019-09-10 03:52:37,177 INFO L226 Difference]: Without dead ends: 6401 [2019-09-10 03:52:37,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states. [2019-09-10 03:52:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6313. [2019-09-10 03:52:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6313 states. [2019-09-10 03:52:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6313 states to 6313 states and 7985 transitions. [2019-09-10 03:52:37,297 INFO L78 Accepts]: Start accepts. Automaton has 6313 states and 7985 transitions. Word has length 143 [2019-09-10 03:52:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:37,297 INFO L475 AbstractCegarLoop]: Abstraction has 6313 states and 7985 transitions. [2019-09-10 03:52:37,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:52:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6313 states and 7985 transitions. [2019-09-10 03:52:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 03:52:37,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:37,300 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:52:37,301 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1437443568, now seen corresponding path program 1 times [2019-09-10 03:52:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:37,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 03:52:37,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:37,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:52:37,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:37,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:52:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:52:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:52:37,387 INFO L87 Difference]: Start difference. First operand 6313 states and 7985 transitions. Second operand 7 states. [2019-09-10 03:52:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:38,526 INFO L93 Difference]: Finished difference Result 6204 states and 7856 transitions. [2019-09-10 03:52:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:52:38,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2019-09-10 03:52:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:38,537 INFO L225 Difference]: With dead ends: 6204 [2019-09-10 03:52:38,537 INFO L226 Difference]: Without dead ends: 6188 [2019-09-10 03:52:38,537 INFO L628 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-09-10 03:52:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6188 states. [2019-09-10 03:52:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6188 to 6167. [2019-09-10 03:52:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-09-10 03:52:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 7817 transitions. [2019-09-10 03:52:38,660 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 7817 transitions. Word has length 148 [2019-09-10 03:52:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:38,660 INFO L475 AbstractCegarLoop]: Abstraction has 6167 states and 7817 transitions. [2019-09-10 03:52:38,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:52:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 7817 transitions. [2019-09-10 03:52:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 03:52:38,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:38,669 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:52:38,669 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2104950802, now seen corresponding path program 1 times [2019-09-10 03:52:38,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:38,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:38,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-10 03:52:38,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:52:38,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:52:38,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-09-10 03:52:38,952 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [15], [16], [42], [45], [82], [86], [89], [93], [96], [100], [101], [102], [103], [104], [106], [115], [120], [122], [124], [130], [134], [138], [141], [145], [146], [147], [151], [154], [162], [163], [166], [168], [171], [173], [174], [176], [179], [181], [186], [197], [209], [212], [213], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [263], [273], [277], [282], [284], [289], [291], [296], [298], [358], [359], [362], [371], [373], [440], [443], [446], [448], [451], [453], [456], [474], [477], [508], [511], [552], [554], [555], [556], [557], [558], [559], [560], [564], [567], [575], [579], [582], [583], [587], [590], [594], [595], [596], [599], [600], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [621], [622], [623], [624], [625], [626], [629], [630], [639], [640], [641], [642], [643], [644], [647], [648], [655], [656], [673], [674], [675] [2019-09-10 03:52:38,995 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:52:38,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:52:39,122 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:52:39,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:52:39,291 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 695 root evaluator evaluations with a maximum evaluation depth of 6. Performed 695 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 115 variables. [2019-09-10 03:52:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:39,296 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:52:39,748 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 77.34% of their original sizes. [2019-09-10 03:52:39,748 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:52:45,596 INFO L420 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2019-09-10 03:52:45,596 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:52:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:52:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [16] total 83 [2019-09-10 03:52:45,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:45,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 03:52:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 03:52:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4298, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:52:45,602 INFO L87 Difference]: Start difference. First operand 6167 states and 7817 transitions. Second operand 69 states. [2019-09-10 03:52:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 03:52:57,086 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~nomsg~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-10 03:52:57,092 INFO L168 Benchmark]: Toolchain (without parser) took 68954.18 ms. Allocated memory was 139.5 MB in the beginning and 1.0 GB in the end (delta: 896.5 MB). Free memory was 86.0 MB in the beginning and 221.7 MB in the end (delta: -135.7 MB). Peak memory consumption was 760.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,093 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.39 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 85.8 MB in the beginning and 168.9 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,096 INFO L168 Benchmark]: Boogie Preprocessor took 83.15 ms. Allocated memory is still 199.2 MB. Free memory was 168.9 MB in the beginning and 165.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,097 INFO L168 Benchmark]: RCFGBuilder took 948.56 ms. Allocated memory is still 199.2 MB. Free memory was 165.4 MB in the beginning and 104.9 MB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,099 INFO L168 Benchmark]: TraceAbstraction took 67323.03 ms. Allocated memory was 199.2 MB in the beginning and 1.0 GB in the end (delta: 836.8 MB). Free memory was 104.3 MB in the beginning and 221.7 MB in the end (delta: -117.4 MB). Peak memory consumption was 719.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:52:57,112 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 594.39 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 85.8 MB in the beginning and 168.9 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.15 ms. Allocated memory is still 199.2 MB. Free memory was 168.9 MB in the beginning and 165.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 948.56 ms. Allocated memory is still 199.2 MB. Free memory was 165.4 MB in the beginning and 104.9 MB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67323.03 ms. Allocated memory was 199.2 MB in the beginning and 1.0 GB in the end (delta: 836.8 MB). Free memory was 104.3 MB in the beginning and 221.7 MB in the end (delta: -117.4 MB). Peak memory consumption was 719.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~nomsg~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~nomsg~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...