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/systemc/transmitter.11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:48:41,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:48:41,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:48:41,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:48:41,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:48:41,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:48:41,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:48:41,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:48:41,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:48:41,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:48:41,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:48:41,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:48:41,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:48:41,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:48:41,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:48:41,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:48:41,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:48:41,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:48:41,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:48:41,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:48:41,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:48:41,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:48:41,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:48:41,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:48:41,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:48:41,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:48:41,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:48:41,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:48:41,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:48:41,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:48:41,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:48:41,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:48:41,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:48:41,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:48:41,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:48:41,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:48:41,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:48:41,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:48:41,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:48:41,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:48:41,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:48:41,133 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:48:41,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:48:41,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:48:41,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:48:41,148 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:48:41,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:48:41,149 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:48:41,149 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:48:41,149 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:48:41,149 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:48:41,149 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:48:41,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:48:41,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:48:41,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:48:41,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:48:41,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:48:41,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:48:41,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:48:41,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:48:41,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:48:41,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:48:41,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:48:41,152 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:48:41,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:48:41,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:48:41,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:48:41,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:48:41,153 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:48:41,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:48:41,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:48:41,154 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:48:41,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:48:41,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:48:41,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:48:41,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:48:41,200 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:48:41,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.11.cil.c [2019-09-10 03:48:41,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96761614e/cd417bc96f3f4dda9d11ea5486a5982a/FLAG2171c5fdb [2019-09-10 03:48:41,741 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:48:41,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.11.cil.c [2019-09-10 03:48:41,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96761614e/cd417bc96f3f4dda9d11ea5486a5982a/FLAG2171c5fdb [2019-09-10 03:48:42,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96761614e/cd417bc96f3f4dda9d11ea5486a5982a [2019-09-10 03:48:42,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:48:42,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:48:42,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:48:42,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:48:42,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:48:42,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc6461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42, skipping insertion in model container [2019-09-10 03:48:42,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,108 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:48:42,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:48:42,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:48:42,687 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:48:42,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:48:42,825 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:48:42,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42 WrapperNode [2019-09-10 03:48:42,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:48:42,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:48:42,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:48:42,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:48:42,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (1/1) ... [2019-09-10 03:48:42,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:48:42,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:48:42,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:48:42,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:48:42,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (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:48:43,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:48:43,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:48:43,020 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:48:43,020 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:48:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:48:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:48:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:48:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:48:43,021 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:48:43,022 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:48:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:48:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:48:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:48:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:48:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:48:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:48:43,025 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:48:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:48:43,027 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:48:43,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:48:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:48:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:48:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:48:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:48:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:48:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:48:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:48:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:48:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:48:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:48:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:48:44,290 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:48:44,293 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-10 03:48:44,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:48:44 BoogieIcfgContainer [2019-09-10 03:48:44,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:48:44,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:48:44,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:48:44,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:48:44,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:48:42" (1/3) ... [2019-09-10 03:48:44,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5011e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:48:44, skipping insertion in model container [2019-09-10 03:48:44,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:48:42" (2/3) ... [2019-09-10 03:48:44,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5011e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:48:44, skipping insertion in model container [2019-09-10 03:48:44,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:48:44" (3/3) ... [2019-09-10 03:48:44,303 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.11.cil.c [2019-09-10 03:48:44,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:48:44,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:48:44,351 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:48:44,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:48:44,377 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:48:44,378 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:48:44,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:48:44,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:48:44,378 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:48:44,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:48:44,379 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:48:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states. [2019-09-10 03:48:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:44,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:44,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,435 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1954601429, now seen corresponding path program 1 times [2019-09-10 03:48:44,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:44,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:44,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:44,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:44,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:44,999 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:48:45,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:45,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:48:45,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:45,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:48:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:48:45,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:48:45,027 INFO L87 Difference]: Start difference. First operand 439 states. Second operand 4 states. [2019-09-10 03:48:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:45,503 INFO L93 Difference]: Finished difference Result 437 states and 633 transitions. [2019-09-10 03:48:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:48:45,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:48:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:45,524 INFO L225 Difference]: With dead ends: 437 [2019-09-10 03:48:45,524 INFO L226 Difference]: Without dead ends: 430 [2019-09-10 03:48:45,526 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:48:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-10 03:48:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2019-09-10 03:48:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 626 transitions. [2019-09-10 03:48:45,636 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 626 transitions. Word has length 225 [2019-09-10 03:48:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:45,645 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 626 transitions. [2019-09-10 03:48:45,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:48:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 626 transitions. [2019-09-10 03:48:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:45,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:45,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,658 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1100061971, now seen corresponding path program 1 times [2019-09-10 03:48:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:45,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:45,949 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:48:45,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:45,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:48:45,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:45,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:48:45,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:48:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:48:45,957 INFO L87 Difference]: Start difference. First operand 430 states and 626 transitions. Second operand 4 states. [2019-09-10 03:48:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:46,230 INFO L93 Difference]: Finished difference Result 430 states and 625 transitions. [2019-09-10 03:48:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:48:46,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:48:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:46,235 INFO L225 Difference]: With dead ends: 430 [2019-09-10 03:48:46,235 INFO L226 Difference]: Without dead ends: 430 [2019-09-10 03:48:46,236 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:48:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-10 03:48:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2019-09-10 03:48:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 625 transitions. [2019-09-10 03:48:46,260 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 625 transitions. Word has length 225 [2019-09-10 03:48:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:46,260 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 625 transitions. [2019-09-10 03:48:46,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:48:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 625 transitions. [2019-09-10 03:48:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:46,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:46,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:46,265 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash 830439855, now seen corresponding path program 1 times [2019-09-10 03:48:46,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:46,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:48:46,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:46,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:46,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:46,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:46,465 INFO L87 Difference]: Start difference. First operand 430 states and 625 transitions. Second operand 5 states. [2019-09-10 03:48:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:47,395 INFO L93 Difference]: Finished difference Result 494 states and 743 transitions. [2019-09-10 03:48:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:47,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:47,399 INFO L225 Difference]: With dead ends: 494 [2019-09-10 03:48:47,400 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 03:48:47,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 03:48:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 430. [2019-09-10 03:48:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2019-09-10 03:48:47,419 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 225 [2019-09-10 03:48:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:47,420 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2019-09-10 03:48:47,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2019-09-10 03:48:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:47,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:47,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,424 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash 756855277, now seen corresponding path program 1 times [2019-09-10 03:48:47,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:47,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:47,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:47,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:47,573 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:48:47,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:47,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:47,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:47,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:47,576 INFO L87 Difference]: Start difference. First operand 430 states and 624 transitions. Second operand 5 states. [2019-09-10 03:48:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:48,519 INFO L93 Difference]: Finished difference Result 494 states and 743 transitions. [2019-09-10 03:48:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:48,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:48,523 INFO L225 Difference]: With dead ends: 494 [2019-09-10 03:48:48,523 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 03:48:48,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 03:48:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 430. [2019-09-10 03:48:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 623 transitions. [2019-09-10 03:48:48,540 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 623 transitions. Word has length 225 [2019-09-10 03:48:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:48,541 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 623 transitions. [2019-09-10 03:48:48,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 623 transitions. [2019-09-10 03:48:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:48,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:48,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,545 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1323728401, now seen corresponding path program 1 times [2019-09-10 03:48:48,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:48,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:48,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:48:48,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:48,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:48,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:48,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:48,691 INFO L87 Difference]: Start difference. First operand 430 states and 623 transitions. Second operand 5 states. [2019-09-10 03:48:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:49,513 INFO L93 Difference]: Finished difference Result 492 states and 738 transitions. [2019-09-10 03:48:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:49,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:49,520 INFO L225 Difference]: With dead ends: 492 [2019-09-10 03:48:49,520 INFO L226 Difference]: Without dead ends: 492 [2019-09-10 03:48:49,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-09-10 03:48:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 430. [2019-09-10 03:48:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 622 transitions. [2019-09-10 03:48:49,557 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 622 transitions. Word has length 225 [2019-09-10 03:48:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:49,557 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 622 transitions. [2019-09-10 03:48:49,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 622 transitions. [2019-09-10 03:48:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:49,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:49,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:49,563 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash -836654675, now seen corresponding path program 1 times [2019-09-10 03:48:49,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:49,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:49,748 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:48:49,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:49,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:49,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:49,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:49,751 INFO L87 Difference]: Start difference. First operand 430 states and 622 transitions. Second operand 5 states. [2019-09-10 03:48:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:50,581 INFO L93 Difference]: Finished difference Result 490 states and 733 transitions. [2019-09-10 03:48:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:50,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:50,585 INFO L225 Difference]: With dead ends: 490 [2019-09-10 03:48:50,586 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:48:50,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:48:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 430. [2019-09-10 03:48:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 621 transitions. [2019-09-10 03:48:50,601 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 621 transitions. Word has length 225 [2019-09-10 03:48:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:50,602 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 621 transitions. [2019-09-10 03:48:50,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 621 transitions. [2019-09-10 03:48:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:50,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:50,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,606 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1672909359, now seen corresponding path program 1 times [2019-09-10 03:48:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:50,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:50,716 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:48:50,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:50,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:50,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:50,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:50,718 INFO L87 Difference]: Start difference. First operand 430 states and 621 transitions. Second operand 5 states. [2019-09-10 03:48:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:51,546 INFO L93 Difference]: Finished difference Result 488 states and 728 transitions. [2019-09-10 03:48:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:51,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:51,551 INFO L225 Difference]: With dead ends: 488 [2019-09-10 03:48:51,551 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 03:48:51,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 03:48:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 430. [2019-09-10 03:48:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 620 transitions. [2019-09-10 03:48:51,566 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 620 transitions. Word has length 225 [2019-09-10 03:48:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 620 transitions. [2019-09-10 03:48:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 620 transitions. [2019-09-10 03:48:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:51,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:51,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:51,571 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1199673709, now seen corresponding path program 1 times [2019-09-10 03:48:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:51,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:51,697 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:48:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:51,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:51,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:51,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:51,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:51,699 INFO L87 Difference]: Start difference. First operand 430 states and 620 transitions. Second operand 5 states. [2019-09-10 03:48:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:52,607 INFO L93 Difference]: Finished difference Result 486 states and 723 transitions. [2019-09-10 03:48:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:52,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:52,611 INFO L225 Difference]: With dead ends: 486 [2019-09-10 03:48:52,611 INFO L226 Difference]: Without dead ends: 486 [2019-09-10 03:48:52,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-10 03:48:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 430. [2019-09-10 03:48:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 619 transitions. [2019-09-10 03:48:52,626 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 619 transitions. Word has length 225 [2019-09-10 03:48:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:52,627 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 619 transitions. [2019-09-10 03:48:52,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 619 transitions. [2019-09-10 03:48:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:52,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:52,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,629 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1322955375, now seen corresponding path program 1 times [2019-09-10 03:48:52,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:52,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:52,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:52,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:52,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:52,733 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:48:52,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:52,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:52,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:52,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:52,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:52,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:52,735 INFO L87 Difference]: Start difference. First operand 430 states and 619 transitions. Second operand 5 states. [2019-09-10 03:48:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:53,688 INFO L93 Difference]: Finished difference Result 482 states and 714 transitions. [2019-09-10 03:48:53,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:53,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:53,693 INFO L225 Difference]: With dead ends: 482 [2019-09-10 03:48:53,694 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 03:48:53,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 03:48:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 430. [2019-09-10 03:48:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 618 transitions. [2019-09-10 03:48:53,719 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 618 transitions. Word has length 225 [2019-09-10 03:48:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:53,719 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 618 transitions. [2019-09-10 03:48:53,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 618 transitions. [2019-09-10 03:48:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:53,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:53,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,722 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2069091343, now seen corresponding path program 1 times [2019-09-10 03:48:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:53,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:53,858 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:48:53,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:53,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:53,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:53,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:53,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:53,860 INFO L87 Difference]: Start difference. First operand 430 states and 618 transitions. Second operand 5 states. [2019-09-10 03:48:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:54,646 INFO L93 Difference]: Finished difference Result 480 states and 709 transitions. [2019-09-10 03:48:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:54,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:54,649 INFO L225 Difference]: With dead ends: 480 [2019-09-10 03:48:54,649 INFO L226 Difference]: Without dead ends: 480 [2019-09-10 03:48:54,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-10 03:48:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 430. [2019-09-10 03:48:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 617 transitions. [2019-09-10 03:48:54,663 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 617 transitions. Word has length 225 [2019-09-10 03:48:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:54,664 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 617 transitions. [2019-09-10 03:48:54,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 617 transitions. [2019-09-10 03:48:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:54,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:54,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,672 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1977907759, now seen corresponding path program 1 times [2019-09-10 03:48:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:54,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:54,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:54,804 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:48:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:54,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:54,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:54,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:54,806 INFO L87 Difference]: Start difference. First operand 430 states and 617 transitions. Second operand 5 states. [2019-09-10 03:48:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:55,675 INFO L93 Difference]: Finished difference Result 478 states and 704 transitions. [2019-09-10 03:48:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:55,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:55,679 INFO L225 Difference]: With dead ends: 478 [2019-09-10 03:48:55,680 INFO L226 Difference]: Without dead ends: 478 [2019-09-10 03:48:55,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-10 03:48:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 430. [2019-09-10 03:48:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 616 transitions. [2019-09-10 03:48:55,695 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 616 transitions. Word has length 225 [2019-09-10 03:48:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:55,695 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 616 transitions. [2019-09-10 03:48:55,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 616 transitions. [2019-09-10 03:48:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:55,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:55,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,698 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1969908785, now seen corresponding path program 1 times [2019-09-10 03:48:55,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:55,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:55,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:55,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:55,796 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:48:55,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:55,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:55,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:55,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:55,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:55,798 INFO L87 Difference]: Start difference. First operand 430 states and 616 transitions. Second operand 5 states. [2019-09-10 03:48:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:56,608 INFO L93 Difference]: Finished difference Result 476 states and 699 transitions. [2019-09-10 03:48:56,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:56,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:56,613 INFO L225 Difference]: With dead ends: 476 [2019-09-10 03:48:56,613 INFO L226 Difference]: Without dead ends: 476 [2019-09-10 03:48:56,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-10 03:48:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 430. [2019-09-10 03:48:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 615 transitions. [2019-09-10 03:48:56,633 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 615 transitions. Word has length 225 [2019-09-10 03:48:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:56,633 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 615 transitions. [2019-09-10 03:48:56,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 615 transitions. [2019-09-10 03:48:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:56,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:56,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:56,637 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:56,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash -801295889, now seen corresponding path program 1 times [2019-09-10 03:48:56,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:56,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:56,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:56,777 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:48:56,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:56,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:56,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:56,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:56,779 INFO L87 Difference]: Start difference. First operand 430 states and 615 transitions. Second operand 5 states. [2019-09-10 03:48:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:57,605 INFO L93 Difference]: Finished difference Result 474 states and 694 transitions. [2019-09-10 03:48:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:57,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:57,610 INFO L225 Difference]: With dead ends: 474 [2019-09-10 03:48:57,610 INFO L226 Difference]: Without dead ends: 474 [2019-09-10 03:48:57,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-10 03:48:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 430. [2019-09-10 03:48:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 614 transitions. [2019-09-10 03:48:57,627 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 614 transitions. Word has length 225 [2019-09-10 03:48:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:57,628 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 614 transitions. [2019-09-10 03:48:57,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 614 transitions. [2019-09-10 03:48:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:57,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:57,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:57,630 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 356236401, now seen corresponding path program 1 times [2019-09-10 03:48:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:57,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:57,765 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:48:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:57,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:57,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:57,769 INFO L87 Difference]: Start difference. First operand 430 states and 614 transitions. Second operand 5 states. [2019-09-10 03:48:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:58,830 INFO L93 Difference]: Finished difference Result 518 states and 775 transitions. [2019-09-10 03:48:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:48:58,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:48:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:58,836 INFO L225 Difference]: With dead ends: 518 [2019-09-10 03:48:58,836 INFO L226 Difference]: Without dead ends: 518 [2019-09-10 03:48:58,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:48:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-10 03:48:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 430. [2019-09-10 03:48:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:48:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 613 transitions. [2019-09-10 03:48:58,862 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 613 transitions. Word has length 225 [2019-09-10 03:48:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:58,863 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 613 transitions. [2019-09-10 03:48:58,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2019-09-10 03:48:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:48:58,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:58,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:58,868 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash -991897169, now seen corresponding path program 1 times [2019-09-10 03:48:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:58,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:58,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:58,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:59,070 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:48:59,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:59,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:59,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:59,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:59,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:59,073 INFO L87 Difference]: Start difference. First operand 430 states and 613 transitions. Second operand 5 states. [2019-09-10 03:49:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:00,103 INFO L93 Difference]: Finished difference Result 516 states and 770 transitions. [2019-09-10 03:49:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:00,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:00,108 INFO L225 Difference]: With dead ends: 516 [2019-09-10 03:49:00,109 INFO L226 Difference]: Without dead ends: 516 [2019-09-10 03:49:00,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-10 03:49:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 430. [2019-09-10 03:49:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 612 transitions. [2019-09-10 03:49:00,134 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 612 transitions. Word has length 225 [2019-09-10 03:49:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:00,135 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 612 transitions. [2019-09-10 03:49:00,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 612 transitions. [2019-09-10 03:49:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:00,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:00,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,139 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 765729969, now seen corresponding path program 1 times [2019-09-10 03:49:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:00,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:00,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:00,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:00,338 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:49:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:00,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:00,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:00,343 INFO L87 Difference]: Start difference. First operand 430 states and 612 transitions. Second operand 5 states. [2019-09-10 03:49:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:01,374 INFO L93 Difference]: Finished difference Result 512 states and 761 transitions. [2019-09-10 03:49:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:01,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:01,379 INFO L225 Difference]: With dead ends: 512 [2019-09-10 03:49:01,379 INFO L226 Difference]: Without dead ends: 512 [2019-09-10 03:49:01,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-10 03:49:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 430. [2019-09-10 03:49:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 611 transitions. [2019-09-10 03:49:01,400 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 611 transitions. Word has length 225 [2019-09-10 03:49:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:01,400 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 611 transitions. [2019-09-10 03:49:01,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 611 transitions. [2019-09-10 03:49:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:01,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:01,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,405 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -50317261, now seen corresponding path program 1 times [2019-09-10 03:49:01,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:01,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:01,585 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:49:01,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:01,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:01,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:01,588 INFO L87 Difference]: Start difference. First operand 430 states and 611 transitions. Second operand 5 states. [2019-09-10 03:49:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:02,611 INFO L93 Difference]: Finished difference Result 510 states and 756 transitions. [2019-09-10 03:49:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:02,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:02,615 INFO L225 Difference]: With dead ends: 510 [2019-09-10 03:49:02,616 INFO L226 Difference]: Without dead ends: 510 [2019-09-10 03:49:02,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-10 03:49:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 430. [2019-09-10 03:49:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 610 transitions. [2019-09-10 03:49:02,630 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 610 transitions. Word has length 225 [2019-09-10 03:49:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:02,630 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 610 transitions. [2019-09-10 03:49:02,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 610 transitions. [2019-09-10 03:49:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:02,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:02,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,633 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2016304015, now seen corresponding path program 1 times [2019-09-10 03:49:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:02,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:02,726 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:49:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:02,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:02,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:02,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:02,729 INFO L87 Difference]: Start difference. First operand 430 states and 610 transitions. Second operand 5 states. [2019-09-10 03:49:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:03,610 INFO L93 Difference]: Finished difference Result 508 states and 751 transitions. [2019-09-10 03:49:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:03,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:03,615 INFO L225 Difference]: With dead ends: 508 [2019-09-10 03:49:03,616 INFO L226 Difference]: Without dead ends: 508 [2019-09-10 03:49:03,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-10 03:49:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 430. [2019-09-10 03:49:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 609 transitions. [2019-09-10 03:49:03,630 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 609 transitions. Word has length 225 [2019-09-10 03:49:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:03,631 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 609 transitions. [2019-09-10 03:49:03,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 609 transitions. [2019-09-10 03:49:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:03,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:03,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,634 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash -417154957, now seen corresponding path program 1 times [2019-09-10 03:49:03,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:03,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:03,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:03,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:03,773 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:49:03,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:03,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:03,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:03,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:03,776 INFO L87 Difference]: Start difference. First operand 430 states and 609 transitions. Second operand 5 states. [2019-09-10 03:49:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:04,604 INFO L93 Difference]: Finished difference Result 506 states and 746 transitions. [2019-09-10 03:49:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:04,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:04,608 INFO L225 Difference]: With dead ends: 506 [2019-09-10 03:49:04,608 INFO L226 Difference]: Without dead ends: 506 [2019-09-10 03:49:04,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-10 03:49:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 430. [2019-09-10 03:49:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 608 transitions. [2019-09-10 03:49:04,621 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 608 transitions. Word has length 225 [2019-09-10 03:49:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:04,621 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 608 transitions. [2019-09-10 03:49:04,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 608 transitions. [2019-09-10 03:49:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:04,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:04,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,624 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 188619825, now seen corresponding path program 1 times [2019-09-10 03:49:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:04,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:04,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:04,720 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:49:04,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:04,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:04,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:04,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:04,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:04,722 INFO L87 Difference]: Start difference. First operand 430 states and 608 transitions. Second operand 5 states. [2019-09-10 03:49:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:05,601 INFO L93 Difference]: Finished difference Result 504 states and 741 transitions. [2019-09-10 03:49:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:05,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:05,604 INFO L225 Difference]: With dead ends: 504 [2019-09-10 03:49:05,604 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 03:49:05,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 03:49:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 430. [2019-09-10 03:49:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 607 transitions. [2019-09-10 03:49:05,617 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 607 transitions. Word has length 225 [2019-09-10 03:49:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:05,619 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 607 transitions. [2019-09-10 03:49:05,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 607 transitions. [2019-09-10 03:49:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:05,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:05,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:05,622 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 208160947, now seen corresponding path program 1 times [2019-09-10 03:49:05,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:05,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:05,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:05,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:05,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:05,762 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:49:05,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:05,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:05,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:05,764 INFO L87 Difference]: Start difference. First operand 430 states and 607 transitions. Second operand 5 states. [2019-09-10 03:49:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:06,606 INFO L93 Difference]: Finished difference Result 502 states and 736 transitions. [2019-09-10 03:49:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:06,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:06,610 INFO L225 Difference]: With dead ends: 502 [2019-09-10 03:49:06,611 INFO L226 Difference]: Without dead ends: 502 [2019-09-10 03:49:06,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-10 03:49:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 430. [2019-09-10 03:49:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 606 transitions. [2019-09-10 03:49:06,623 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 606 transitions. Word has length 225 [2019-09-10 03:49:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:06,623 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 606 transitions. [2019-09-10 03:49:06,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 606 transitions. [2019-09-10 03:49:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:06,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:06,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:06,626 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash -622492687, now seen corresponding path program 1 times [2019-09-10 03:49:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:06,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:06,722 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:49:06,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:06,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:49:06,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:06,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:49:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:49:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:49:06,725 INFO L87 Difference]: Start difference. First operand 430 states and 606 transitions. Second operand 5 states. [2019-09-10 03:49:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:07,544 INFO L93 Difference]: Finished difference Result 500 states and 731 transitions. [2019-09-10 03:49:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:49:07,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 03:49:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:07,551 INFO L225 Difference]: With dead ends: 500 [2019-09-10 03:49:07,551 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 03:49:07,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 03:49:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 430. [2019-09-10 03:49:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 03:49:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 605 transitions. [2019-09-10 03:49:07,563 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 605 transitions. Word has length 225 [2019-09-10 03:49:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:07,564 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 605 transitions. [2019-09-10 03:49:07,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:49:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 605 transitions. [2019-09-10 03:49:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:07,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:07,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:07,566 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash -95098637, now seen corresponding path program 1 times [2019-09-10 03:49:07,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:07,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:07,659 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:49:07,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:07,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:07,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:07,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:07,660 INFO L87 Difference]: Start difference. First operand 430 states and 605 transitions. Second operand 4 states. [2019-09-10 03:49:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:08,079 INFO L93 Difference]: Finished difference Result 822 states and 1153 transitions. [2019-09-10 03:49:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:08,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:08,084 INFO L225 Difference]: With dead ends: 822 [2019-09-10 03:49:08,084 INFO L226 Difference]: Without dead ends: 822 [2019-09-10 03:49:08,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-09-10 03:49:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 817. [2019-09-10 03:49:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-10 03:49:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1149 transitions. [2019-09-10 03:49:08,108 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1149 transitions. Word has length 225 [2019-09-10 03:49:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:08,108 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1149 transitions. [2019-09-10 03:49:08,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1149 transitions. [2019-09-10 03:49:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:08,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:08,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:08,111 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 884601780, now seen corresponding path program 1 times [2019-09-10 03:49:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:08,196 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:49:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:08,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:08,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:08,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:08,198 INFO L87 Difference]: Start difference. First operand 817 states and 1149 transitions. Second operand 6 states. [2019-09-10 03:49:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:08,248 INFO L93 Difference]: Finished difference Result 857 states and 1212 transitions. [2019-09-10 03:49:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:08,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:08,255 INFO L225 Difference]: With dead ends: 857 [2019-09-10 03:49:08,255 INFO L226 Difference]: Without dead ends: 857 [2019-09-10 03:49:08,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-10 03:49:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 822. [2019-09-10 03:49:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-09-10 03:49:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1153 transitions. [2019-09-10 03:49:08,297 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1153 transitions. Word has length 225 [2019-09-10 03:49:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:08,297 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1153 transitions. [2019-09-10 03:49:08,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1153 transitions. [2019-09-10 03:49:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:08,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:08,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:08,300 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1551983670, now seen corresponding path program 1 times [2019-09-10 03:49:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:08,432 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:49:08,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:08,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:08,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:08,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:08,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:08,434 INFO L87 Difference]: Start difference. First operand 822 states and 1153 transitions. Second operand 4 states. [2019-09-10 03:49:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:08,838 INFO L93 Difference]: Finished difference Result 1601 states and 2240 transitions. [2019-09-10 03:49:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:08,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:08,844 INFO L225 Difference]: With dead ends: 1601 [2019-09-10 03:49:08,845 INFO L226 Difference]: Without dead ends: 1601 [2019-09-10 03:49:08,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-09-10 03:49:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1594. [2019-09-10 03:49:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-09-10 03:49:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2234 transitions. [2019-09-10 03:49:08,884 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2234 transitions. Word has length 225 [2019-09-10 03:49:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:08,884 INFO L475 AbstractCegarLoop]: Abstraction has 1594 states and 2234 transitions. [2019-09-10 03:49:08,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2234 transitions. [2019-09-10 03:49:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:08,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:08,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:08,887 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1824394325, now seen corresponding path program 1 times [2019-09-10 03:49:08,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:08,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:08,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:08,969 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:49:08,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:08,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:08,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:08,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:08,972 INFO L87 Difference]: Start difference. First operand 1594 states and 2234 transitions. Second operand 6 states. [2019-09-10 03:49:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:09,009 INFO L93 Difference]: Finished difference Result 1668 states and 2350 transitions. [2019-09-10 03:49:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:09,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:09,016 INFO L225 Difference]: With dead ends: 1668 [2019-09-10 03:49:09,016 INFO L226 Difference]: Without dead ends: 1668 [2019-09-10 03:49:09,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-09-10 03:49:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1604. [2019-09-10 03:49:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-09-10 03:49:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2242 transitions. [2019-09-10 03:49:09,056 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2242 transitions. Word has length 225 [2019-09-10 03:49:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:09,057 INFO L475 AbstractCegarLoop]: Abstraction has 1604 states and 2242 transitions. [2019-09-10 03:49:09,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2242 transitions. [2019-09-10 03:49:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:09,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:09,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,059 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash 901226899, now seen corresponding path program 1 times [2019-09-10 03:49:09,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:09,144 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:49:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:09,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:09,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:09,146 INFO L87 Difference]: Start difference. First operand 1604 states and 2242 transitions. Second operand 6 states. [2019-09-10 03:49:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:09,185 INFO L93 Difference]: Finished difference Result 1740 states and 2459 transitions. [2019-09-10 03:49:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:09,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:09,194 INFO L225 Difference]: With dead ends: 1740 [2019-09-10 03:49:09,195 INFO L226 Difference]: Without dead ends: 1740 [2019-09-10 03:49:09,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-09-10 03:49:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1624. [2019-09-10 03:49:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-09-10 03:49:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2262 transitions. [2019-09-10 03:49:09,238 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2262 transitions. Word has length 225 [2019-09-10 03:49:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:09,239 INFO L475 AbstractCegarLoop]: Abstraction has 1624 states and 2262 transitions. [2019-09-10 03:49:09,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2262 transitions. [2019-09-10 03:49:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:09,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:09,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,242 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 745246357, now seen corresponding path program 1 times [2019-09-10 03:49:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:09,349 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:49:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:09,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:09,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:09,351 INFO L87 Difference]: Start difference. First operand 1624 states and 2262 transitions. Second operand 4 states. [2019-09-10 03:49:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:09,773 INFO L93 Difference]: Finished difference Result 3193 states and 4440 transitions. [2019-09-10 03:49:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:09,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:09,786 INFO L225 Difference]: With dead ends: 3193 [2019-09-10 03:49:09,786 INFO L226 Difference]: Without dead ends: 3193 [2019-09-10 03:49:09,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-09-10 03:49:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3182. [2019-09-10 03:49:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-09-10 03:49:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4430 transitions. [2019-09-10 03:49:09,860 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4430 transitions. Word has length 225 [2019-09-10 03:49:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:09,860 INFO L475 AbstractCegarLoop]: Abstraction has 3182 states and 4430 transitions. [2019-09-10 03:49:09,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4430 transitions. [2019-09-10 03:49:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:09,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:09,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,863 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash -78950284, now seen corresponding path program 1 times [2019-09-10 03:49:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:09,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:09,943 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:49:09,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:09,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:09,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:09,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:09,945 INFO L87 Difference]: Start difference. First operand 3182 states and 4430 transitions. Second operand 6 states. [2019-09-10 03:49:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:09,986 INFO L93 Difference]: Finished difference Result 3306 states and 4622 transitions. [2019-09-10 03:49:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:09,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:10,000 INFO L225 Difference]: With dead ends: 3306 [2019-09-10 03:49:10,000 INFO L226 Difference]: Without dead ends: 3306 [2019-09-10 03:49:10,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2019-09-10 03:49:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3202. [2019-09-10 03:49:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3202 states. [2019-09-10 03:49:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 4446 transitions. [2019-09-10 03:49:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 4446 transitions. Word has length 225 [2019-09-10 03:49:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:10,084 INFO L475 AbstractCegarLoop]: Abstraction has 3202 states and 4446 transitions. [2019-09-10 03:49:10,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 4446 transitions. [2019-09-10 03:49:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:10,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:10,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,087 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 209869106, now seen corresponding path program 1 times [2019-09-10 03:49:10,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:10,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:10,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:10,229 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:49:10,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:10,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:10,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:10,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:10,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:10,231 INFO L87 Difference]: Start difference. First operand 3202 states and 4446 transitions. Second operand 4 states. [2019-09-10 03:49:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:10,663 INFO L93 Difference]: Finished difference Result 6325 states and 8778 transitions. [2019-09-10 03:49:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:10,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:10,697 INFO L225 Difference]: With dead ends: 6325 [2019-09-10 03:49:10,697 INFO L226 Difference]: Without dead ends: 6325 [2019-09-10 03:49:10,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2019-09-10 03:49:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 6306. [2019-09-10 03:49:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6306 states. [2019-09-10 03:49:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6306 states to 6306 states and 8760 transitions. [2019-09-10 03:49:10,831 INFO L78 Accepts]: Start accepts. Automaton has 6306 states and 8760 transitions. Word has length 225 [2019-09-10 03:49:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:10,831 INFO L475 AbstractCegarLoop]: Abstraction has 6306 states and 8760 transitions. [2019-09-10 03:49:10,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6306 states and 8760 transitions. [2019-09-10 03:49:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:10,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:10,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,834 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -567660429, now seen corresponding path program 1 times [2019-09-10 03:49:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:10,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:11,060 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:49:11,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:11,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:11,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:11,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:11,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:11,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:11,064 INFO L87 Difference]: Start difference. First operand 6306 states and 8760 transitions. Second operand 6 states. [2019-09-10 03:49:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:11,142 INFO L93 Difference]: Finished difference Result 6530 states and 9104 transitions. [2019-09-10 03:49:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:11,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:11,170 INFO L225 Difference]: With dead ends: 6530 [2019-09-10 03:49:11,170 INFO L226 Difference]: Without dead ends: 6530 [2019-09-10 03:49:11,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2019-09-10 03:49:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6346. [2019-09-10 03:49:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6346 states. [2019-09-10 03:49:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 8792 transitions. [2019-09-10 03:49:11,348 INFO L78 Accepts]: Start accepts. Automaton has 6346 states and 8792 transitions. Word has length 225 [2019-09-10 03:49:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:11,349 INFO L475 AbstractCegarLoop]: Abstraction has 6346 states and 8792 transitions. [2019-09-10 03:49:11,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6346 states and 8792 transitions. [2019-09-10 03:49:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:11,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:11,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,352 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 294173173, now seen corresponding path program 1 times [2019-09-10 03:49:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:11,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:11,459 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:49:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:11,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:11,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:11,461 INFO L87 Difference]: Start difference. First operand 6346 states and 8792 transitions. Second operand 4 states. [2019-09-10 03:49:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:11,903 INFO L93 Difference]: Finished difference Result 12565 states and 17428 transitions. [2019-09-10 03:49:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:11,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:11,952 INFO L225 Difference]: With dead ends: 12565 [2019-09-10 03:49:11,952 INFO L226 Difference]: Without dead ends: 12565 [2019-09-10 03:49:11,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2019-09-10 03:49:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 12530. [2019-09-10 03:49:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12530 states. [2019-09-10 03:49:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12530 states to 12530 states and 17394 transitions. [2019-09-10 03:49:12,222 INFO L78 Accepts]: Start accepts. Automaton has 12530 states and 17394 transitions. Word has length 225 [2019-09-10 03:49:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:12,224 INFO L475 AbstractCegarLoop]: Abstraction has 12530 states and 17394 transitions. [2019-09-10 03:49:12,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 12530 states and 17394 transitions. [2019-09-10 03:49:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:12,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:12,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,230 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -934115948, now seen corresponding path program 1 times [2019-09-10 03:49:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:12,326 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:49:12,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:12,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:12,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:12,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:12,332 INFO L87 Difference]: Start difference. First operand 12530 states and 17394 transitions. Second operand 6 states. [2019-09-10 03:49:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:12,414 INFO L93 Difference]: Finished difference Result 12930 states and 18002 transitions. [2019-09-10 03:49:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:12,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:12,465 INFO L225 Difference]: With dead ends: 12930 [2019-09-10 03:49:12,465 INFO L226 Difference]: Without dead ends: 12930 [2019-09-10 03:49:12,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2019-09-10 03:49:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12610. [2019-09-10 03:49:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12610 states. [2019-09-10 03:49:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12610 states to 12610 states and 17458 transitions. [2019-09-10 03:49:12,854 INFO L78 Accepts]: Start accepts. Automaton has 12610 states and 17458 transitions. Word has length 225 [2019-09-10 03:49:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:12,855 INFO L475 AbstractCegarLoop]: Abstraction has 12610 states and 17458 transitions. [2019-09-10 03:49:12,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12610 states and 17458 transitions. [2019-09-10 03:49:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:12,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:12,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,858 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1067770322, now seen corresponding path program 1 times [2019-09-10 03:49:12,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:12,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:12,999 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:49:13,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:13,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:13,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:13,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:13,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:13,001 INFO L87 Difference]: Start difference. First operand 12610 states and 17458 transitions. Second operand 4 states. [2019-09-10 03:49:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:13,566 INFO L93 Difference]: Finished difference Result 24997 states and 34730 transitions. [2019-09-10 03:49:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:13,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:13,662 INFO L225 Difference]: With dead ends: 24997 [2019-09-10 03:49:13,662 INFO L226 Difference]: Without dead ends: 24997 [2019-09-10 03:49:13,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24997 states. [2019-09-10 03:49:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24997 to 24930. [2019-09-10 03:49:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24930 states. [2019-09-10 03:49:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24930 states to 24930 states and 34664 transitions. [2019-09-10 03:49:14,261 INFO L78 Accepts]: Start accepts. Automaton has 24930 states and 34664 transitions. Word has length 225 [2019-09-10 03:49:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:14,261 INFO L475 AbstractCegarLoop]: Abstraction has 24930 states and 34664 transitions. [2019-09-10 03:49:14,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24930 states and 34664 transitions. [2019-09-10 03:49:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:14,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:14,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:14,264 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1792849747, now seen corresponding path program 1 times [2019-09-10 03:49:14,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:14,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:14,355 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:49:14,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:14,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:14,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:14,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:14,356 INFO L87 Difference]: Start difference. First operand 24930 states and 34664 transitions. Second operand 6 states. [2019-09-10 03:49:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:14,498 INFO L93 Difference]: Finished difference Result 25634 states and 35720 transitions. [2019-09-10 03:49:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:14,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:14,577 INFO L225 Difference]: With dead ends: 25634 [2019-09-10 03:49:14,578 INFO L226 Difference]: Without dead ends: 25634 [2019-09-10 03:49:14,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25634 states. [2019-09-10 03:49:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25634 to 25090. [2019-09-10 03:49:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25090 states. [2019-09-10 03:49:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25090 states to 25090 states and 34792 transitions. [2019-09-10 03:49:15,953 INFO L78 Accepts]: Start accepts. Automaton has 25090 states and 34792 transitions. Word has length 225 [2019-09-10 03:49:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 25090 states and 34792 transitions. [2019-09-10 03:49:15,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25090 states and 34792 transitions. [2019-09-10 03:49:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:15,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:15,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:15,956 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1911291221, now seen corresponding path program 1 times [2019-09-10 03:49:15,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:15,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:15,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:16,059 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:49:16,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:16,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:16,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:16,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:16,061 INFO L87 Difference]: Start difference. First operand 25090 states and 34792 transitions. Second operand 4 states. [2019-09-10 03:49:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:16,669 INFO L93 Difference]: Finished difference Result 49765 states and 69500 transitions. [2019-09-10 03:49:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:16,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:16,810 INFO L225 Difference]: With dead ends: 49765 [2019-09-10 03:49:16,810 INFO L226 Difference]: Without dead ends: 49765 [2019-09-10 03:49:16,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49765 states. [2019-09-10 03:49:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49765 to 49634. [2019-09-10 03:49:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49634 states. [2019-09-10 03:49:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49634 states to 49634 states and 69370 transitions. [2019-09-10 03:49:17,852 INFO L78 Accepts]: Start accepts. Automaton has 49634 states and 69370 transitions. Word has length 225 [2019-09-10 03:49:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:17,852 INFO L475 AbstractCegarLoop]: Abstraction has 49634 states and 69370 transitions. [2019-09-10 03:49:17,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 49634 states and 69370 transitions. [2019-09-10 03:49:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:17,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:17,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:17,855 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash 46318260, now seen corresponding path program 1 times [2019-09-10 03:49:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:17,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:17,939 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:49:17,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:17,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:17,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:17,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:17,941 INFO L87 Difference]: Start difference. First operand 49634 states and 69370 transitions. Second operand 6 states. [2019-09-10 03:49:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:18,239 INFO L93 Difference]: Finished difference Result 50850 states and 71162 transitions. [2019-09-10 03:49:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:18,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:18,381 INFO L225 Difference]: With dead ends: 50850 [2019-09-10 03:49:18,382 INFO L226 Difference]: Without dead ends: 50850 [2019-09-10 03:49:18,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50850 states. [2019-09-10 03:49:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50850 to 49954. [2019-09-10 03:49:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49954 states. [2019-09-10 03:49:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49954 states to 49954 states and 69626 transitions. [2019-09-10 03:49:20,464 INFO L78 Accepts]: Start accepts. Automaton has 49954 states and 69626 transitions. Word has length 225 [2019-09-10 03:49:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:20,465 INFO L475 AbstractCegarLoop]: Abstraction has 49954 states and 69626 transitions. [2019-09-10 03:49:20,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 49954 states and 69626 transitions. [2019-09-10 03:49:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:20,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:20,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:20,468 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1010412942, now seen corresponding path program 1 times [2019-09-10 03:49:20,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:20,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:20,558 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:49:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:20,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:20,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:20,560 INFO L87 Difference]: Start difference. First operand 49954 states and 69626 transitions. Second operand 4 states. [2019-09-10 03:49:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:21,352 INFO L93 Difference]: Finished difference Result 99109 states and 139858 transitions. [2019-09-10 03:49:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:21,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:21,636 INFO L225 Difference]: With dead ends: 99109 [2019-09-10 03:49:21,636 INFO L226 Difference]: Without dead ends: 99109 [2019-09-10 03:49:21,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99109 states. [2019-09-10 03:49:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99109 to 98850. [2019-09-10 03:49:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98850 states. [2019-09-10 03:49:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98850 states to 98850 states and 139600 transitions. [2019-09-10 03:49:23,323 INFO L78 Accepts]: Start accepts. Automaton has 98850 states and 139600 transitions. Word has length 225 [2019-09-10 03:49:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:23,324 INFO L475 AbstractCegarLoop]: Abstraction has 98850 states and 139600 transitions. [2019-09-10 03:49:23,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 98850 states and 139600 transitions. [2019-09-10 03:49:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:23,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:23,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,327 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash 106772019, now seen corresponding path program 1 times [2019-09-10 03:49:23,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:23,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:23,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:25,574 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:49:25,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:25,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:25,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:25,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:25,576 INFO L87 Difference]: Start difference. First operand 98850 states and 139600 transitions. Second operand 6 states. [2019-09-10 03:49:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:26,051 INFO L93 Difference]: Finished difference Result 100898 states and 142544 transitions. [2019-09-10 03:49:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:26,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:26,356 INFO L225 Difference]: With dead ends: 100898 [2019-09-10 03:49:26,356 INFO L226 Difference]: Without dead ends: 100898 [2019-09-10 03:49:26,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100898 states. [2019-09-10 03:49:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100898 to 99490. [2019-09-10 03:49:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99490 states. [2019-09-10 03:49:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99490 states to 99490 states and 140112 transitions. [2019-09-10 03:49:27,809 INFO L78 Accepts]: Start accepts. Automaton has 99490 states and 140112 transitions. Word has length 225 [2019-09-10 03:49:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:27,809 INFO L475 AbstractCegarLoop]: Abstraction has 99490 states and 140112 transitions. [2019-09-10 03:49:27,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99490 states and 140112 transitions. [2019-09-10 03:49:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:27,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:27,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,811 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:27,811 INFO L82 PathProgramCache]: Analyzing trace with hash -479504203, now seen corresponding path program 1 times [2019-09-10 03:49:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:27,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:27,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:27,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:27,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:27,901 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:49:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:27,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:27,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:27,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:27,902 INFO L87 Difference]: Start difference. First operand 99490 states and 140112 transitions. Second operand 4 states. [2019-09-10 03:49:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:29,785 INFO L93 Difference]: Finished difference Result 197413 states and 283668 transitions. [2019-09-10 03:49:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:29,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:30,200 INFO L225 Difference]: With dead ends: 197413 [2019-09-10 03:49:30,200 INFO L226 Difference]: Without dead ends: 197413 [2019-09-10 03:49:30,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197413 states. [2019-09-10 03:49:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197413 to 196898. [2019-09-10 03:49:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196898 states. [2019-09-10 03:49:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196898 states to 196898 states and 283154 transitions. [2019-09-10 03:49:39,363 INFO L78 Accepts]: Start accepts. Automaton has 196898 states and 283154 transitions. Word has length 225 [2019-09-10 03:49:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:39,363 INFO L475 AbstractCegarLoop]: Abstraction has 196898 states and 283154 transitions. [2019-09-10 03:49:39,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:49:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 196898 states and 283154 transitions. [2019-09-10 03:49:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:39,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:39,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,365 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash -934410284, now seen corresponding path program 1 times [2019-09-10 03:49:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:39,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:39,460 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:49:39,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:39,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:49:39,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:39,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:49:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:49:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:49:39,462 INFO L87 Difference]: Start difference. First operand 196898 states and 283154 transitions. Second operand 6 states. [2019-09-10 03:49:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:40,566 INFO L93 Difference]: Finished difference Result 200226 states and 287762 transitions. [2019-09-10 03:49:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:49:40,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:49:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:41,121 INFO L225 Difference]: With dead ends: 200226 [2019-09-10 03:49:41,121 INFO L226 Difference]: Without dead ends: 200226 [2019-09-10 03:49:41,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:49:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200226 states. [2019-09-10 03:49:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200226 to 198178. [2019-09-10 03:49:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198178 states. [2019-09-10 03:49:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198178 states to 198178 states and 284178 transitions. [2019-09-10 03:49:45,703 INFO L78 Accepts]: Start accepts. Automaton has 198178 states and 284178 transitions. Word has length 225 [2019-09-10 03:49:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:45,703 INFO L475 AbstractCegarLoop]: Abstraction has 198178 states and 284178 transitions. [2019-09-10 03:49:45,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:49:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 198178 states and 284178 transitions. [2019-09-10 03:49:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:49:45,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:45,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,705 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -95376622, now seen corresponding path program 1 times [2019-09-10 03:49:45,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:45,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:45,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:45,790 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:49:45,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:49:45,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:49:45,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:45,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:49:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:49:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:45,792 INFO L87 Difference]: Start difference. First operand 198178 states and 284178 transitions. Second operand 4 states. [2019-09-10 03:49:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:53,609 INFO L93 Difference]: Finished difference Result 393253 states and 581850 transitions. [2019-09-10 03:49:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:49:53,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:49:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:54,544 INFO L225 Difference]: With dead ends: 393253 [2019-09-10 03:49:54,544 INFO L226 Difference]: Without dead ends: 393253 [2019-09-10 03:49:54,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:49:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393253 states. [2019-09-10 03:50:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393253 to 392226. [2019-09-10 03:50:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392226 states. [2019-09-10 03:50:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392226 states to 392226 states and 580824 transitions. [2019-09-10 03:50:06,406 INFO L78 Accepts]: Start accepts. Automaton has 392226 states and 580824 transitions. Word has length 225 [2019-09-10 03:50:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:06,406 INFO L475 AbstractCegarLoop]: Abstraction has 392226 states and 580824 transitions. [2019-09-10 03:50:06,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 392226 states and 580824 transitions. [2019-09-10 03:50:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:50:06,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:06,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,408 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 45722899, now seen corresponding path program 1 times [2019-09-10 03:50:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:06,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:06,499 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:50:06,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:06,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:06,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:06,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:06,501 INFO L87 Difference]: Start difference. First operand 392226 states and 580824 transitions. Second operand 6 states. [2019-09-10 03:50:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:16,125 INFO L93 Difference]: Finished difference Result 397346 states and 587480 transitions. [2019-09-10 03:50:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:16,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 03:50:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:17,109 INFO L225 Difference]: With dead ends: 397346 [2019-09-10 03:50:17,109 INFO L226 Difference]: Without dead ends: 397346 [2019-09-10 03:50:17,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:50:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397346 states. [2019-09-10 03:50:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397346 to 394786. [2019-09-10 03:50:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394786 states. [2019-09-10 03:50:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394786 states to 394786 states and 582872 transitions. [2019-09-10 03:50:30,634 INFO L78 Accepts]: Start accepts. Automaton has 394786 states and 582872 transitions. Word has length 225 [2019-09-10 03:50:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:30,635 INFO L475 AbstractCegarLoop]: Abstraction has 394786 states and 582872 transitions. [2019-09-10 03:50:30,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 394786 states and 582872 transitions. [2019-09-10 03:50:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 03:50:30,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:30,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,638 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash -446903275, now seen corresponding path program 1 times [2019-09-10 03:50:30,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:30,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:30,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:38,848 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:50:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:38,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:38,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:38,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:38,850 INFO L87 Difference]: Start difference. First operand 394786 states and 582872 transitions. Second operand 4 states. [2019-09-10 03:50:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:55,275 INFO L93 Difference]: Finished difference Result 784418 states and 1213482 transitions. [2019-09-10 03:50:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:55,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-10 03:50:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:57,892 INFO L225 Difference]: With dead ends: 784418 [2019-09-10 03:50:57,893 INFO L226 Difference]: Without dead ends: 784418 [2019-09-10 03:50:57,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784418 states. [2019-09-10 03:51:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784418 to 781349. [2019-09-10 03:51:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781349 states. [2019-09-10 03:51:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781349 states to 781349 states and 1210413 transitions. [2019-09-10 03:51:48,790 INFO L78 Accepts]: Start accepts. Automaton has 781349 states and 1210413 transitions. Word has length 225 [2019-09-10 03:51:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:48,790 INFO L475 AbstractCegarLoop]: Abstraction has 781349 states and 1210413 transitions. [2019-09-10 03:51:48,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 781349 states and 1210413 transitions. [2019-09-10 03:51:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 03:51:48,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:48,825 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,825 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash -347936272, now seen corresponding path program 1 times [2019-09-10 03:51:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:48,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:51:48,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:48,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:51:48,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:48,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:51:48,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:51:48,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:51:48,933 INFO L87 Difference]: Start difference. First operand 781349 states and 1210413 transitions. Second operand 6 states. [2019-09-10 03:52:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:12,208 INFO L93 Difference]: Finished difference Result 788517 states and 1218605 transitions. [2019-09-10 03:52:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:52:12,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-10 03:52:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:15,095 INFO L225 Difference]: With dead ends: 788517 [2019-09-10 03:52:15,095 INFO L226 Difference]: Without dead ends: 788517 [2019-09-10 03:52:15,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:52:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788517 states. [2019-09-10 03:52:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788517 to 786469. [2019-09-10 03:52:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786469 states.