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.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:50:05,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:50:05,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:50:05,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:50:05,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:50:05,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:50:05,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:50:05,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:50:05,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:50:05,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:50:05,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:50:05,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:50:05,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:50:05,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:50:05,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:50:05,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:50:05,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:50:05,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:50:05,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:50:05,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:50:05,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:50:05,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:50:05,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:50:05,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:50:05,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:50:05,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:50:05,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:50:05,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:50:05,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:50:05,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:50:05,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:50:05,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:50:05,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:50:05,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:50:05,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:50:05,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:50:05,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:50:05,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:50:05,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:50:05,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:50:05,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:50:05,530 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:50:05,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:50:05,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:50:05,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:50:05,545 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:50:05,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:50:05,546 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:50:05,546 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:50:05,547 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:50:05,547 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:50:05,547 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:50:05,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:50:05,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:50:05,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:50:05,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:50:05,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:50:05,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:50:05,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:50:05,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:50:05,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:50:05,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:50:05,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:50:05,550 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:50:05,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:50:05,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:50:05,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:50:05,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:50:05,551 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:50:05,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:50:05,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:50:05,551 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:50:05,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:50:05,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:50:05,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:50:05,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:50:05,596 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:50:05,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.15.cil.c [2019-09-10 03:50:05,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b33e5830/b73509a57f0a4b449d3960de30354c82/FLAG04713a090 [2019-09-10 03:50:06,182 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:50:06,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.15.cil.c [2019-09-10 03:50:06,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b33e5830/b73509a57f0a4b449d3960de30354c82/FLAG04713a090 [2019-09-10 03:50:06,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b33e5830/b73509a57f0a4b449d3960de30354c82 [2019-09-10 03:50:06,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:50:06,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:50:06,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:50:06,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:50:06,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:50:06,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:50:06" (1/1) ... [2019-09-10 03:50:06,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a8ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:06, skipping insertion in model container [2019-09-10 03:50:06,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:50:06" (1/1) ... [2019-09-10 03:50:06,522 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:50:06,586 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:50:07,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:50:07,100 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:50:07,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:50:07,215 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:50:07,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07 WrapperNode [2019-09-10 03:50:07,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:50:07,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:50:07,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:50:07,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:50:07,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (1/1) ... [2019-09-10 03:50:07,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:50:07,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:50:07,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:50:07,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:50:07,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (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:50:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:50:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:50:07,421 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:50:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:50:07,423 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:50:07,423 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:50:07,423 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:50:07,424 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:50:07,424 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:50:07,425 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:50:07,425 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-10 03:50:07,425 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-10 03:50:07,426 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:50:07,426 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:50:07,426 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:50:07,426 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:50:07,427 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:50:07,427 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:50:07,427 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:50:07,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:50:07,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:50:07,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:50:07,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:50:07,429 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:50:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:50:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:50:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:50:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:50:07,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:50:07,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:50:07,431 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:50:07,431 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:50:07,431 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:50:07,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:50:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:50:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-10 03:50:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:50:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:50:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:50:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:50:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:50:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:50:07,436 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:50:07,436 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:50:07,436 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:50:07,436 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:50:07,436 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:50:07,437 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:50:07,437 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:50:07,437 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-10 03:50:07,437 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-10 03:50:07,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:50:07,438 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:50:07,438 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:50:07,438 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:50:07,439 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:50:07,439 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:50:07,439 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:50:07,439 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:50:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:50:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:50:08,796 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:50:08,797 INFO L283 CfgBuilder]: Removed 17 assume(true) statements. [2019-09-10 03:50:08,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:50:08 BoogieIcfgContainer [2019-09-10 03:50:08,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:50:08,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:50:08,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:50:08,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:50:08,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:50:06" (1/3) ... [2019-09-10 03:50:08,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d91d4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:50:08, skipping insertion in model container [2019-09-10 03:50:08,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:50:07" (2/3) ... [2019-09-10 03:50:08,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d91d4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:50:08, skipping insertion in model container [2019-09-10 03:50:08,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:50:08" (3/3) ... [2019-09-10 03:50:08,806 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.c [2019-09-10 03:50:08,816 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:50:08,825 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:50:08,843 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:50:08,876 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:50:08,876 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:50:08,877 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:50:08,877 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:50:08,877 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:50:08,878 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:50:08,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:50:08,879 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:50:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states. [2019-09-10 03:50:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:08,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:08,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:08,940 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash 754746292, now seen corresponding path program 1 times [2019-09-10 03:50:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:08,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:08,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:08,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:09,578 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:09,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:09,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:09,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:09,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:09,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:09,604 INFO L87 Difference]: Start difference. First operand 499 states. Second operand 4 states. [2019-09-10 03:50:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:10,038 INFO L93 Difference]: Finished difference Result 497 states and 725 transitions. [2019-09-10 03:50:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:10,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:10,076 INFO L225 Difference]: With dead ends: 497 [2019-09-10 03:50:10,083 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:50:10,087 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:50:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:50:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-09-10 03:50:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 718 transitions. [2019-09-10 03:50:10,173 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 718 transitions. Word has length 240 [2019-09-10 03:50:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:10,175 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 718 transitions. [2019-09-10 03:50:10,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2019-09-10 03:50:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:10,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:10,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:10,190 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -332213258, now seen corresponding path program 1 times [2019-09-10 03:50:10,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:10,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:10,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:10,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:10,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:50:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:10,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:10,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:10,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:10,464 INFO L87 Difference]: Start difference. First operand 490 states and 718 transitions. Second operand 4 states. [2019-09-10 03:50:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:10,744 INFO L93 Difference]: Finished difference Result 490 states and 717 transitions. [2019-09-10 03:50:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:10,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:10,752 INFO L225 Difference]: With dead ends: 490 [2019-09-10 03:50:10,752 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:50:10,753 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:50:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:50:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-09-10 03:50:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 717 transitions. [2019-09-10 03:50:10,811 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 717 transitions. Word has length 240 [2019-09-10 03:50:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:10,811 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 717 transitions. [2019-09-10 03:50:10,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 717 transitions. [2019-09-10 03:50:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:10,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:10,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:10,822 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash -275347912, now seen corresponding path program 1 times [2019-09-10 03:50:10,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:10,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:10,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:10,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:11,085 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:11,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:11,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:11,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:11,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:11,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:11,088 INFO L87 Difference]: Start difference. First operand 490 states and 717 transitions. Second operand 5 states. [2019-09-10 03:50:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:12,155 INFO L93 Difference]: Finished difference Result 562 states and 851 transitions. [2019-09-10 03:50:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:12,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:12,160 INFO L225 Difference]: With dead ends: 562 [2019-09-10 03:50:12,160 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 03:50:12,161 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:50:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 03:50:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 490. [2019-09-10 03:50:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 716 transitions. [2019-09-10 03:50:12,187 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 716 transitions. Word has length 240 [2019-09-10 03:50:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:12,188 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 716 transitions. [2019-09-10 03:50:12,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 716 transitions. [2019-09-10 03:50:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:12,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:12,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:12,216 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash -996267334, now seen corresponding path program 1 times [2019-09-10 03:50:12,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:12,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:12,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:12,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:12,340 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:12,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:12,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:12,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:12,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:12,343 INFO L87 Difference]: Start difference. First operand 490 states and 716 transitions. Second operand 5 states. [2019-09-10 03:50:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:13,305 INFO L93 Difference]: Finished difference Result 562 states and 851 transitions. [2019-09-10 03:50:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:13,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:13,310 INFO L225 Difference]: With dead ends: 562 [2019-09-10 03:50:13,310 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 03:50:13,311 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:50:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 03:50:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 490. [2019-09-10 03:50:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 715 transitions. [2019-09-10 03:50:13,332 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 715 transitions. Word has length 240 [2019-09-10 03:50:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:13,333 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 715 transitions. [2019-09-10 03:50:13,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 715 transitions. [2019-09-10 03:50:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:13,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:13,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:13,342 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1850806792, now seen corresponding path program 1 times [2019-09-10 03:50:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:13,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:13,488 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:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:13,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:13,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:13,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:13,490 INFO L87 Difference]: Start difference. First operand 490 states and 715 transitions. Second operand 5 states. [2019-09-10 03:50:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:14,389 INFO L93 Difference]: Finished difference Result 560 states and 846 transitions. [2019-09-10 03:50:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:14,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:14,393 INFO L225 Difference]: With dead ends: 560 [2019-09-10 03:50:14,393 INFO L226 Difference]: Without dead ends: 560 [2019-09-10 03:50:14,394 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:50:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-10 03:50:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 490. [2019-09-10 03:50:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 714 transitions. [2019-09-10 03:50:14,412 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 714 transitions. Word has length 240 [2019-09-10 03:50:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:14,412 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 714 transitions. [2019-09-10 03:50:14,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 714 transitions. [2019-09-10 03:50:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:14,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:14,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:14,416 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1308216058, now seen corresponding path program 1 times [2019-09-10 03:50:14,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:14,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:14,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:14,538 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:14,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:14,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:14,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:14,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:14,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:14,540 INFO L87 Difference]: Start difference. First operand 490 states and 714 transitions. Second operand 5 states. [2019-09-10 03:50:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:15,509 INFO L93 Difference]: Finished difference Result 558 states and 841 transitions. [2019-09-10 03:50:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:15,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:15,514 INFO L225 Difference]: With dead ends: 558 [2019-09-10 03:50:15,514 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 03:50:15,514 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:50:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 03:50:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 490. [2019-09-10 03:50:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 713 transitions. [2019-09-10 03:50:15,531 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 713 transitions. Word has length 240 [2019-09-10 03:50:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:15,531 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 713 transitions. [2019-09-10 03:50:15,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 713 transitions. [2019-09-10 03:50:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:15,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:15,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:15,535 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash 440288696, now seen corresponding path program 1 times [2019-09-10 03:50:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:15,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:15,660 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:15,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:15,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:15,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:15,662 INFO L87 Difference]: Start difference. First operand 490 states and 713 transitions. Second operand 5 states. [2019-09-10 03:50:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:16,704 INFO L93 Difference]: Finished difference Result 556 states and 836 transitions. [2019-09-10 03:50:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:16,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:16,711 INFO L225 Difference]: With dead ends: 556 [2019-09-10 03:50:16,711 INFO L226 Difference]: Without dead ends: 556 [2019-09-10 03:50:16,711 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:50:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-10 03:50:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 490. [2019-09-10 03:50:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 712 transitions. [2019-09-10 03:50:16,728 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 712 transitions. Word has length 240 [2019-09-10 03:50:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:16,729 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 712 transitions. [2019-09-10 03:50:16,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 712 transitions. [2019-09-10 03:50:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:16,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:16,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:16,731 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -834634950, now seen corresponding path program 1 times [2019-09-10 03:50:16,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:16,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:16,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:16,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:50:16,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:16,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:16,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:16,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:16,865 INFO L87 Difference]: Start difference. First operand 490 states and 712 transitions. Second operand 5 states. [2019-09-10 03:50:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:17,884 INFO L93 Difference]: Finished difference Result 554 states and 831 transitions. [2019-09-10 03:50:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:17,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:17,890 INFO L225 Difference]: With dead ends: 554 [2019-09-10 03:50:17,890 INFO L226 Difference]: Without dead ends: 554 [2019-09-10 03:50:17,891 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:50:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-10 03:50:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 490. [2019-09-10 03:50:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 711 transitions. [2019-09-10 03:50:17,910 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 711 transitions. Word has length 240 [2019-09-10 03:50:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:17,911 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 711 transitions. [2019-09-10 03:50:17,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 711 transitions. [2019-09-10 03:50:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:17,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:17,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:17,913 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1707045512, now seen corresponding path program 1 times [2019-09-10 03:50:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:17,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:17,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:18,052 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:18,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:18,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:18,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:18,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:18,054 INFO L87 Difference]: Start difference. First operand 490 states and 711 transitions. Second operand 5 states. [2019-09-10 03:50:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:19,044 INFO L93 Difference]: Finished difference Result 550 states and 822 transitions. [2019-09-10 03:50:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:19,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:19,048 INFO L225 Difference]: With dead ends: 550 [2019-09-10 03:50:19,048 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 03:50:19,049 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:50:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 03:50:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 490. [2019-09-10 03:50:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 710 transitions. [2019-09-10 03:50:19,065 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 710 transitions. Word has length 240 [2019-09-10 03:50:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:19,065 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 710 transitions. [2019-09-10 03:50:19,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 710 transitions. [2019-09-10 03:50:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:19,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:19,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:19,068 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1493428426, now seen corresponding path program 1 times [2019-09-10 03:50:19,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:19,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:19,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:19,206 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:19,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:19,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:19,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:19,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:19,208 INFO L87 Difference]: Start difference. First operand 490 states and 710 transitions. Second operand 5 states. [2019-09-10 03:50:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:20,190 INFO L93 Difference]: Finished difference Result 548 states and 817 transitions. [2019-09-10 03:50:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:20,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:20,194 INFO L225 Difference]: With dead ends: 548 [2019-09-10 03:50:20,194 INFO L226 Difference]: Without dead ends: 548 [2019-09-10 03:50:20,194 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:50:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-10 03:50:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 490. [2019-09-10 03:50:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 709 transitions. [2019-09-10 03:50:20,208 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 709 transitions. Word has length 240 [2019-09-10 03:50:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:20,209 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 709 transitions. [2019-09-10 03:50:20,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 709 transitions. [2019-09-10 03:50:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:20,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:20,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:20,211 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1209442888, now seen corresponding path program 1 times [2019-09-10 03:50:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:20,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:20,316 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:20,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:20,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:20,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:20,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:20,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:20,318 INFO L87 Difference]: Start difference. First operand 490 states and 709 transitions. Second operand 5 states. [2019-09-10 03:50:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:21,312 INFO L93 Difference]: Finished difference Result 546 states and 812 transitions. [2019-09-10 03:50:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:21,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:21,316 INFO L225 Difference]: With dead ends: 546 [2019-09-10 03:50:21,317 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 03:50:21,317 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:50:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 03:50:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 490. [2019-09-10 03:50:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 708 transitions. [2019-09-10 03:50:21,331 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 708 transitions. Word has length 240 [2019-09-10 03:50:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:21,331 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 708 transitions. [2019-09-10 03:50:21,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 708 transitions. [2019-09-10 03:50:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:21,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:21,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:21,334 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1155022582, now seen corresponding path program 1 times [2019-09-10 03:50:21,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:21,439 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:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:21,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:21,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:21,441 INFO L87 Difference]: Start difference. First operand 490 states and 708 transitions. Second operand 5 states. [2019-09-10 03:50:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:22,451 INFO L93 Difference]: Finished difference Result 544 states and 807 transitions. [2019-09-10 03:50:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:22,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:22,455 INFO L225 Difference]: With dead ends: 544 [2019-09-10 03:50:22,455 INFO L226 Difference]: Without dead ends: 544 [2019-09-10 03:50:22,456 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:50:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-10 03:50:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 490. [2019-09-10 03:50:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 707 transitions. [2019-09-10 03:50:22,469 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 707 transitions. Word has length 240 [2019-09-10 03:50:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:22,469 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 707 transitions. [2019-09-10 03:50:22,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 707 transitions. [2019-09-10 03:50:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:22,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:22,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:22,472 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -569819656, now seen corresponding path program 1 times [2019-09-10 03:50:22,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:22,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:22,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:50:22,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:22,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:22,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:22,577 INFO L87 Difference]: Start difference. First operand 490 states and 707 transitions. Second operand 5 states. [2019-09-10 03:50:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:23,528 INFO L93 Difference]: Finished difference Result 542 states and 802 transitions. [2019-09-10 03:50:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:23,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:23,532 INFO L225 Difference]: With dead ends: 542 [2019-09-10 03:50:23,532 INFO L226 Difference]: Without dead ends: 542 [2019-09-10 03:50:23,532 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:50:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-10 03:50:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 490. [2019-09-10 03:50:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 706 transitions. [2019-09-10 03:50:23,545 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 706 transitions. Word has length 240 [2019-09-10 03:50:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:23,545 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 706 transitions. [2019-09-10 03:50:23,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 706 transitions. [2019-09-10 03:50:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:23,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:23,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:23,548 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1729844918, now seen corresponding path program 1 times [2019-09-10 03:50:23,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:23,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:23,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:23,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:50:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:23,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:23,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:23,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:23,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:23,656 INFO L87 Difference]: Start difference. First operand 490 states and 706 transitions. Second operand 5 states. [2019-09-10 03:50:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:24,592 INFO L93 Difference]: Finished difference Result 540 states and 797 transitions. [2019-09-10 03:50:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:24,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:24,595 INFO L225 Difference]: With dead ends: 540 [2019-09-10 03:50:24,595 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 03:50:24,595 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:50:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 03:50:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 490. [2019-09-10 03:50:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 705 transitions. [2019-09-10 03:50:24,608 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 705 transitions. Word has length 240 [2019-09-10 03:50:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:24,608 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 705 transitions. [2019-09-10 03:50:24,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 705 transitions. [2019-09-10 03:50:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:24,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:24,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:24,611 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -551277000, now seen corresponding path program 1 times [2019-09-10 03:50:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:24,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:24,715 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:24,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:24,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:24,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:24,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:24,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:24,717 INFO L87 Difference]: Start difference. First operand 490 states and 705 transitions. Second operand 5 states. [2019-09-10 03:50:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:25,670 INFO L93 Difference]: Finished difference Result 538 states and 792 transitions. [2019-09-10 03:50:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:25,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:25,674 INFO L225 Difference]: With dead ends: 538 [2019-09-10 03:50:25,674 INFO L226 Difference]: Without dead ends: 538 [2019-09-10 03:50:25,674 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:50:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-10 03:50:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 490. [2019-09-10 03:50:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 704 transitions. [2019-09-10 03:50:25,687 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 704 transitions. Word has length 240 [2019-09-10 03:50:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:25,687 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 704 transitions. [2019-09-10 03:50:25,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 704 transitions. [2019-09-10 03:50:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:25,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:25,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:25,689 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash -624861578, now seen corresponding path program 1 times [2019-09-10 03:50:25,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:25,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:25,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:25,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:25,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:25,828 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:25,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:25,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:25,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:25,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:25,830 INFO L87 Difference]: Start difference. First operand 490 states and 704 transitions. Second operand 5 states. [2019-09-10 03:50:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:26,855 INFO L93 Difference]: Finished difference Result 587 states and 882 transitions. [2019-09-10 03:50:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:26,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:26,860 INFO L225 Difference]: With dead ends: 587 [2019-09-10 03:50:26,860 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 03:50:26,861 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:50:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 03:50:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 490. [2019-09-10 03:50:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2019-09-10 03:50:26,883 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 240 [2019-09-10 03:50:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:26,884 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2019-09-10 03:50:26,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2019-09-10 03:50:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:26,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:26,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:26,886 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash -137787852, now seen corresponding path program 1 times [2019-09-10 03:50:26,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:26,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:26,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:27,000 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:27,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:27,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:27,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:27,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:27,002 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand 5 states. [2019-09-10 03:50:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:27,942 INFO L93 Difference]: Finished difference Result 585 states and 877 transitions. [2019-09-10 03:50:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:27,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:27,947 INFO L225 Difference]: With dead ends: 585 [2019-09-10 03:50:27,947 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 03:50:27,947 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:50:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 03:50:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 490. [2019-09-10 03:50:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 702 transitions. [2019-09-10 03:50:27,959 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 702 transitions. Word has length 240 [2019-09-10 03:50:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:27,960 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 702 transitions. [2019-09-10 03:50:27,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 702 transitions. [2019-09-10 03:50:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:27,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:27,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:27,962 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:27,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1923191114, now seen corresponding path program 1 times [2019-09-10 03:50:27,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:27,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:27,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:27,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:28,111 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:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:28,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:28,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:28,113 INFO L87 Difference]: Start difference. First operand 490 states and 702 transitions. Second operand 5 states. [2019-09-10 03:50:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:29,046 INFO L93 Difference]: Finished difference Result 583 states and 872 transitions. [2019-09-10 03:50:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:29,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:29,050 INFO L225 Difference]: With dead ends: 583 [2019-09-10 03:50:29,051 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 03:50:29,051 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:50:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 03:50:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 490. [2019-09-10 03:50:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 701 transitions. [2019-09-10 03:50:29,062 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 701 transitions. Word has length 240 [2019-09-10 03:50:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:29,063 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 701 transitions. [2019-09-10 03:50:29,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 701 transitions. [2019-09-10 03:50:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:29,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:29,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:29,065 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:29,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1898540532, now seen corresponding path program 1 times [2019-09-10 03:50:29,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:29,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:29,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:29,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:29,169 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:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:29,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:29,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:29,172 INFO L87 Difference]: Start difference. First operand 490 states and 701 transitions. Second operand 5 states. [2019-09-10 03:50:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:30,148 INFO L93 Difference]: Finished difference Result 581 states and 867 transitions. [2019-09-10 03:50:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:30,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:30,152 INFO L225 Difference]: With dead ends: 581 [2019-09-10 03:50:30,152 INFO L226 Difference]: Without dead ends: 581 [2019-09-10 03:50:30,152 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:50:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-10 03:50:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 490. [2019-09-10 03:50:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 700 transitions. [2019-09-10 03:50:30,163 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 700 transitions. Word has length 240 [2019-09-10 03:50:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:30,164 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 700 transitions. [2019-09-10 03:50:30,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 700 transitions. [2019-09-10 03:50:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:30,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:30,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:30,166 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2021822198, now seen corresponding path program 1 times [2019-09-10 03:50:30,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:30,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:30,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:30,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:30,310 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:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:30,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:30,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:30,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:30,312 INFO L87 Difference]: Start difference. First operand 490 states and 700 transitions. Second operand 5 states. [2019-09-10 03:50:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:31,289 INFO L93 Difference]: Finished difference Result 579 states and 862 transitions. [2019-09-10 03:50:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:31,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:31,295 INFO L225 Difference]: With dead ends: 579 [2019-09-10 03:50:31,295 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 03:50:31,295 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:50:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 03:50:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 490. [2019-09-10 03:50:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 699 transitions. [2019-09-10 03:50:31,313 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 699 transitions. Word has length 240 [2019-09-10 03:50:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:31,314 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 699 transitions. [2019-09-10 03:50:31,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 699 transitions. [2019-09-10 03:50:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:31,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:31,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:31,317 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash -52410956, now seen corresponding path program 1 times [2019-09-10 03:50:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:31,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:31,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:31,479 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:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:31,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:31,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:31,482 INFO L87 Difference]: Start difference. First operand 490 states and 699 transitions. Second operand 5 states. [2019-09-10 03:50:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:32,500 INFO L93 Difference]: Finished difference Result 577 states and 857 transitions. [2019-09-10 03:50:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:32,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:32,504 INFO L225 Difference]: With dead ends: 577 [2019-09-10 03:50:32,505 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 03:50:32,505 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:50:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 03:50:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 490. [2019-09-10 03:50:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 698 transitions. [2019-09-10 03:50:32,516 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 698 transitions. Word has length 240 [2019-09-10 03:50:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:32,516 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 698 transitions. [2019-09-10 03:50:32,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 698 transitions. [2019-09-10 03:50:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:32,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:32,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:32,518 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 850509622, now seen corresponding path program 1 times [2019-09-10 03:50:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:32,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:32,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:32,647 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:32,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:32,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:32,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:32,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:32,648 INFO L87 Difference]: Start difference. First operand 490 states and 698 transitions. Second operand 5 states. [2019-09-10 03:50:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:33,537 INFO L93 Difference]: Finished difference Result 575 states and 852 transitions. [2019-09-10 03:50:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:33,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:33,544 INFO L225 Difference]: With dead ends: 575 [2019-09-10 03:50:33,544 INFO L226 Difference]: Without dead ends: 575 [2019-09-10 03:50:33,544 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:50:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-10 03:50:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 490. [2019-09-10 03:50:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 697 transitions. [2019-09-10 03:50:33,556 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 697 transitions. Word has length 240 [2019-09-10 03:50:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:33,556 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 697 transitions. [2019-09-10 03:50:33,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 697 transitions. [2019-09-10 03:50:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:33,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:33,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:33,558 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash 602541428, now seen corresponding path program 1 times [2019-09-10 03:50:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:50:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:33,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:33,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:33,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:33,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:33,657 INFO L87 Difference]: Start difference. First operand 490 states and 697 transitions. Second operand 5 states. [2019-09-10 03:50:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:34,604 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2019-09-10 03:50:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:34,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:34,606 INFO L225 Difference]: With dead ends: 571 [2019-09-10 03:50:34,606 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 03:50:34,607 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:50:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 03:50:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 490. [2019-09-10 03:50:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 696 transitions. [2019-09-10 03:50:34,617 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 696 transitions. Word has length 240 [2019-09-10 03:50:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:34,617 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 696 transitions. [2019-09-10 03:50:34,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 696 transitions. [2019-09-10 03:50:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:34,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:34,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:34,620 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2126304050, now seen corresponding path program 1 times [2019-09-10 03:50:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:34,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:34,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:34,719 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:34,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:34,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:34,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:34,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:34,722 INFO L87 Difference]: Start difference. First operand 490 states and 696 transitions. Second operand 5 states. [2019-09-10 03:50:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:35,638 INFO L93 Difference]: Finished difference Result 569 states and 838 transitions. [2019-09-10 03:50:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:35,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:35,641 INFO L225 Difference]: With dead ends: 569 [2019-09-10 03:50:35,642 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 03:50:35,642 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:50:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 03:50:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 490. [2019-09-10 03:50:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 695 transitions. [2019-09-10 03:50:35,652 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 695 transitions. Word has length 240 [2019-09-10 03:50:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:35,652 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 695 transitions. [2019-09-10 03:50:35,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 695 transitions. [2019-09-10 03:50:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:35,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:35,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:35,655 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1011130956, now seen corresponding path program 1 times [2019-09-10 03:50:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:35,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:35,767 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:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:35,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:35,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:35,769 INFO L87 Difference]: Start difference. First operand 490 states and 695 transitions. Second operand 5 states. [2019-09-10 03:50:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:36,647 INFO L93 Difference]: Finished difference Result 567 states and 833 transitions. [2019-09-10 03:50:36,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:36,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:36,650 INFO L225 Difference]: With dead ends: 567 [2019-09-10 03:50:36,650 INFO L226 Difference]: Without dead ends: 567 [2019-09-10 03:50:36,651 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:50:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-10 03:50:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 490. [2019-09-10 03:50:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 694 transitions. [2019-09-10 03:50:36,660 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 694 transitions. Word has length 240 [2019-09-10 03:50:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:36,661 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 694 transitions. [2019-09-10 03:50:36,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 694 transitions. [2019-09-10 03:50:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:36,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:36,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:36,663 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1935702770, now seen corresponding path program 1 times [2019-09-10 03:50:36,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:36,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:36,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:36,769 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:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:50:36,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:36,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:50:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:50:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:50:36,771 INFO L87 Difference]: Start difference. First operand 490 states and 694 transitions. Second operand 5 states. [2019-09-10 03:50:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:37,673 INFO L93 Difference]: Finished difference Result 565 states and 828 transitions. [2019-09-10 03:50:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:50:37,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:50:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:37,677 INFO L225 Difference]: With dead ends: 565 [2019-09-10 03:50:37,677 INFO L226 Difference]: Without dead ends: 565 [2019-09-10 03:50:37,677 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:50:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-10 03:50:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 490. [2019-09-10 03:50:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 03:50:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 693 transitions. [2019-09-10 03:50:37,687 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 693 transitions. Word has length 240 [2019-09-10 03:50:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:37,688 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 693 transitions. [2019-09-10 03:50:37,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:50:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 693 transitions. [2019-09-10 03:50:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:37,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:37,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:37,690 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash -601637388, now seen corresponding path program 1 times [2019-09-10 03:50:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:37,783 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:37,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:37,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:37,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:37,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:37,784 INFO L87 Difference]: Start difference. First operand 490 states and 693 transitions. Second operand 6 states. [2019-09-10 03:50:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:37,825 INFO L93 Difference]: Finished difference Result 536 states and 768 transitions. [2019-09-10 03:50:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:37,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:37,828 INFO L225 Difference]: With dead ends: 536 [2019-09-10 03:50:37,828 INFO L226 Difference]: Without dead ends: 536 [2019-09-10 03:50:37,828 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:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-10 03:50:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 495. [2019-09-10 03:50:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:50:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 698 transitions. [2019-09-10 03:50:37,841 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 698 transitions. Word has length 240 [2019-09-10 03:50:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:37,841 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 698 transitions. [2019-09-10 03:50:37,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 698 transitions. [2019-09-10 03:50:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:37,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:37,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:37,843 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1291468878, now seen corresponding path program 1 times [2019-09-10 03:50:37,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:37,932 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:37,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:37,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:37,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:37,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:37,934 INFO L87 Difference]: Start difference. First operand 495 states and 698 transitions. Second operand 6 states. [2019-09-10 03:50:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:37,965 INFO L93 Difference]: Finished difference Result 538 states and 768 transitions. [2019-09-10 03:50:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:37,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:37,968 INFO L225 Difference]: With dead ends: 538 [2019-09-10 03:50:37,968 INFO L226 Difference]: Without dead ends: 538 [2019-09-10 03:50:37,968 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:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-10 03:50:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-09-10 03:50:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:50:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 703 transitions. [2019-09-10 03:50:37,979 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 703 transitions. Word has length 240 [2019-09-10 03:50:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:37,980 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 703 transitions. [2019-09-10 03:50:37,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 703 transitions. [2019-09-10 03:50:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:37,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:37,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:37,982 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -624086988, now seen corresponding path program 1 times [2019-09-10 03:50:37,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:37,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:37,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:38,084 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,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:38,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:38,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:38,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:38,087 INFO L87 Difference]: Start difference. First operand 500 states and 703 transitions. Second operand 6 states. [2019-09-10 03:50:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:38,121 INFO L93 Difference]: Finished difference Result 540 states and 768 transitions. [2019-09-10 03:50:38,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:38,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:38,125 INFO L225 Difference]: With dead ends: 540 [2019-09-10 03:50:38,125 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 03:50:38,126 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:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 03:50:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 505. [2019-09-10 03:50:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 03:50:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 708 transitions. [2019-09-10 03:50:38,137 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 708 transitions. Word has length 240 [2019-09-10 03:50:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:38,139 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 708 transitions. [2019-09-10 03:50:38,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 708 transitions. [2019-09-10 03:50:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:38,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:38,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:38,142 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1547254414, now seen corresponding path program 1 times [2019-09-10 03:50:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:38,262 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,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:38,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:38,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:38,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:38,263 INFO L87 Difference]: Start difference. First operand 505 states and 708 transitions. Second operand 4 states. [2019-09-10 03:50:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:38,633 INFO L93 Difference]: Finished difference Result 971 states and 1356 transitions. [2019-09-10 03:50:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:38,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:38,639 INFO L225 Difference]: With dead ends: 971 [2019-09-10 03:50:38,639 INFO L226 Difference]: Without dead ends: 971 [2019-09-10 03:50:38,639 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:50:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-10 03:50:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 966. [2019-09-10 03:50:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-09-10 03:50:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1352 transitions. [2019-09-10 03:50:38,658 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1352 transitions. Word has length 240 [2019-09-10 03:50:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:38,658 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1352 transitions. [2019-09-10 03:50:38,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1352 transitions. [2019-09-10 03:50:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:38,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:38,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:38,661 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1242148467, now seen corresponding path program 1 times [2019-09-10 03:50:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:38,746 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,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:38,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:38,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:38,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:38,749 INFO L87 Difference]: Start difference. First operand 966 states and 1352 transitions. Second operand 6 states. [2019-09-10 03:50:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:38,796 INFO L93 Difference]: Finished difference Result 1003 states and 1410 transitions. [2019-09-10 03:50:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:38,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:38,807 INFO L225 Difference]: With dead ends: 1003 [2019-09-10 03:50:38,807 INFO L226 Difference]: Without dead ends: 1003 [2019-09-10 03:50:38,808 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:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-10 03:50:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 971. [2019-09-10 03:50:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-10 03:50:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1356 transitions. [2019-09-10 03:50:38,840 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1356 transitions. Word has length 240 [2019-09-10 03:50:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:38,841 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1356 transitions. [2019-09-10 03:50:38,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1356 transitions. [2019-09-10 03:50:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:38,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:38,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:38,843 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1086167925, now seen corresponding path program 1 times [2019-09-10 03:50:38,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:38,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:38,976 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,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:38,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:38,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:38,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:38,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:38,978 INFO L87 Difference]: Start difference. First operand 971 states and 1356 transitions. Second operand 4 states. [2019-09-10 03:50:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:39,448 INFO L93 Difference]: Finished difference Result 1897 states and 2642 transitions. [2019-09-10 03:50:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:39,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:39,458 INFO L225 Difference]: With dead ends: 1897 [2019-09-10 03:50:39,458 INFO L226 Difference]: Without dead ends: 1897 [2019-09-10 03:50:39,460 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:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-09-10 03:50:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1890. [2019-09-10 03:50:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-09-10 03:50:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2636 transitions. [2019-09-10 03:50:39,507 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2636 transitions. Word has length 240 [2019-09-10 03:50:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:39,507 INFO L475 AbstractCegarLoop]: Abstraction has 1890 states and 2636 transitions. [2019-09-10 03:50:39,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2636 transitions. [2019-09-10 03:50:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:39,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:39,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:39,510 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 261971284, now seen corresponding path program 1 times [2019-09-10 03:50:39,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:39,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:50:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:39,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:39,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:39,612 INFO L87 Difference]: Start difference. First operand 1890 states and 2636 transitions. Second operand 6 states. [2019-09-10 03:50:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:39,650 INFO L93 Difference]: Finished difference Result 1958 states and 2742 transitions. [2019-09-10 03:50:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:39,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:39,676 INFO L225 Difference]: With dead ends: 1958 [2019-09-10 03:50:39,676 INFO L226 Difference]: Without dead ends: 1958 [2019-09-10 03:50:39,679 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:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-09-10 03:50:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1900. [2019-09-10 03:50:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-09-10 03:50:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2644 transitions. [2019-09-10 03:50:39,720 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2644 transitions. Word has length 240 [2019-09-10 03:50:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:39,722 INFO L475 AbstractCegarLoop]: Abstraction has 1900 states and 2644 transitions. [2019-09-10 03:50:39,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2644 transitions. [2019-09-10 03:50:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:39,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:39,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:39,724 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 550790674, now seen corresponding path program 1 times [2019-09-10 03:50:39,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:39,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:39,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:39,822 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:39,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:39,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:39,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:39,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:39,824 INFO L87 Difference]: Start difference. First operand 1900 states and 2644 transitions. Second operand 4 states. [2019-09-10 03:50:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:40,244 INFO L93 Difference]: Finished difference Result 3743 states and 5200 transitions. [2019-09-10 03:50:40,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:40,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:40,272 INFO L225 Difference]: With dead ends: 3743 [2019-09-10 03:50:40,273 INFO L226 Difference]: Without dead ends: 3743 [2019-09-10 03:50:40,273 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:50:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2019-09-10 03:50:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3732. [2019-09-10 03:50:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-09-10 03:50:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5190 transitions. [2019-09-10 03:50:40,342 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5190 transitions. Word has length 240 [2019-09-10 03:50:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:40,342 INFO L475 AbstractCegarLoop]: Abstraction has 3732 states and 5190 transitions. [2019-09-10 03:50:40,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5190 transitions. [2019-09-10 03:50:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:40,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:40,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:40,346 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash -226738861, now seen corresponding path program 1 times [2019-09-10 03:50:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:40,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:40,466 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:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:40,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:40,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:40,469 INFO L87 Difference]: Start difference. First operand 3732 states and 5190 transitions. Second operand 6 states. [2019-09-10 03:50:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:40,527 INFO L93 Difference]: Finished difference Result 3856 states and 5382 transitions. [2019-09-10 03:50:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:40,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:40,545 INFO L225 Difference]: With dead ends: 3856 [2019-09-10 03:50:40,546 INFO L226 Difference]: Without dead ends: 3856 [2019-09-10 03:50:40,546 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:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-09-10 03:50:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3752. [2019-09-10 03:50:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2019-09-10 03:50:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5206 transitions. [2019-09-10 03:50:40,631 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5206 transitions. Word has length 240 [2019-09-10 03:50:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:40,631 INFO L475 AbstractCegarLoop]: Abstraction has 3752 states and 5206 transitions. [2019-09-10 03:50:40,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5206 transitions. [2019-09-10 03:50:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:40,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:40,634 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 635094741, now seen corresponding path program 1 times [2019-09-10 03:50:40,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:40,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:40,749 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:40,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:40,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:40,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:40,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:40,751 INFO L87 Difference]: Start difference. First operand 3752 states and 5206 transitions. Second operand 4 states. [2019-09-10 03:50:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:41,191 INFO L93 Difference]: Finished difference Result 7423 states and 10294 transitions. [2019-09-10 03:50:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:41,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:41,214 INFO L225 Difference]: With dead ends: 7423 [2019-09-10 03:50:41,214 INFO L226 Difference]: Without dead ends: 7423 [2019-09-10 03:50:41,214 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:50:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2019-09-10 03:50:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 7404. [2019-09-10 03:50:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7404 states. [2019-09-10 03:50:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 10276 transitions. [2019-09-10 03:50:41,386 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 10276 transitions. Word has length 240 [2019-09-10 03:50:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:41,387 INFO L475 AbstractCegarLoop]: Abstraction has 7404 states and 10276 transitions. [2019-09-10 03:50:41,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 10276 transitions. [2019-09-10 03:50:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:41,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:41,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:41,389 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -593194380, now seen corresponding path program 1 times [2019-09-10 03:50:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:41,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:41,478 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:41,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:41,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:41,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:41,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:41,480 INFO L87 Difference]: Start difference. First operand 7404 states and 10276 transitions. Second operand 6 states. [2019-09-10 03:50:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:41,537 INFO L93 Difference]: Finished difference Result 7628 states and 10620 transitions. [2019-09-10 03:50:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:41,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:41,569 INFO L225 Difference]: With dead ends: 7628 [2019-09-10 03:50:41,569 INFO L226 Difference]: Without dead ends: 7628 [2019-09-10 03:50:41,570 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:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7628 states. [2019-09-10 03:50:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7628 to 7444. [2019-09-10 03:50:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7444 states. [2019-09-10 03:50:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7444 states to 7444 states and 10308 transitions. [2019-09-10 03:50:41,693 INFO L78 Accepts]: Start accepts. Automaton has 7444 states and 10308 transitions. Word has length 240 [2019-09-10 03:50:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:41,693 INFO L475 AbstractCegarLoop]: Abstraction has 7444 states and 10308 transitions. [2019-09-10 03:50:41,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7444 states and 10308 transitions. [2019-09-10 03:50:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:41,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:41,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:41,696 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1408691890, now seen corresponding path program 1 times [2019-09-10 03:50:41,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:41,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:41,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:50:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:41,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:41,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:41,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:41,798 INFO L87 Difference]: Start difference. First operand 7444 states and 10308 transitions. Second operand 4 states. [2019-09-10 03:50:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:42,302 INFO L93 Difference]: Finished difference Result 14759 states and 20456 transitions. [2019-09-10 03:50:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:42,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:42,346 INFO L225 Difference]: With dead ends: 14759 [2019-09-10 03:50:42,347 INFO L226 Difference]: Without dead ends: 14759 [2019-09-10 03:50:42,347 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:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14759 states. [2019-09-10 03:50:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14759 to 14724. [2019-09-10 03:50:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14724 states. [2019-09-10 03:50:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14724 states to 14724 states and 20422 transitions. [2019-09-10 03:50:42,588 INFO L78 Accepts]: Start accepts. Automaton has 14724 states and 20422 transitions. Word has length 240 [2019-09-10 03:50:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:42,589 INFO L475 AbstractCegarLoop]: Abstraction has 14724 states and 20422 transitions. [2019-09-10 03:50:42,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14724 states and 20422 transitions. [2019-09-10 03:50:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:42,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:42,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:42,591 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2133771315, now seen corresponding path program 1 times [2019-09-10 03:50:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:42,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:42,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:42,776 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:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:42,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:42,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:42,777 INFO L87 Difference]: Start difference. First operand 14724 states and 20422 transitions. Second operand 6 states. [2019-09-10 03:50:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:42,861 INFO L93 Difference]: Finished difference Result 15124 states and 21030 transitions. [2019-09-10 03:50:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:42,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:42,910 INFO L225 Difference]: With dead ends: 15124 [2019-09-10 03:50:42,910 INFO L226 Difference]: Without dead ends: 15124 [2019-09-10 03:50:42,911 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:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15124 states. [2019-09-10 03:50:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15124 to 14804. [2019-09-10 03:50:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-09-10 03:50:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 20486 transitions. [2019-09-10 03:50:43,166 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 20486 transitions. Word has length 240 [2019-09-10 03:50:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:43,167 INFO L475 AbstractCegarLoop]: Abstraction has 14804 states and 20486 transitions. [2019-09-10 03:50:43,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 20486 transitions. [2019-09-10 03:50:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:43,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:43,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:43,169 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2042754507, now seen corresponding path program 1 times [2019-09-10 03:50:43,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:43,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:43,272 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:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:43,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:43,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:43,274 INFO L87 Difference]: Start difference. First operand 14804 states and 20486 transitions. Second operand 6 states. [2019-09-10 03:50:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:43,349 INFO L93 Difference]: Finished difference Result 15508 states and 21575 transitions. [2019-09-10 03:50:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:43,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:43,390 INFO L225 Difference]: With dead ends: 15508 [2019-09-10 03:50:43,391 INFO L226 Difference]: Without dead ends: 15508 [2019-09-10 03:50:43,391 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:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15508 states. [2019-09-10 03:50:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15508 to 14964. [2019-09-10 03:50:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14964 states. [2019-09-10 03:50:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14964 states to 14964 states and 20646 transitions. [2019-09-10 03:50:43,651 INFO L78 Accepts]: Start accepts. Automaton has 14964 states and 20646 transitions. Word has length 240 [2019-09-10 03:50:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:43,651 INFO L475 AbstractCegarLoop]: Abstraction has 14964 states and 20646 transitions. [2019-09-10 03:50:43,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14964 states and 20646 transitions. [2019-09-10 03:50:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:43,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:43,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:43,654 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1195481587, now seen corresponding path program 1 times [2019-09-10 03:50:43,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:43,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:43,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:43,761 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:43,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:43,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:43,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:43,763 INFO L87 Difference]: Start difference. First operand 14964 states and 20646 transitions. Second operand 4 states. [2019-09-10 03:50:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:44,807 INFO L93 Difference]: Finished difference Result 29703 states and 41102 transitions. [2019-09-10 03:50:44,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:44,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:44,882 INFO L225 Difference]: With dead ends: 29703 [2019-09-10 03:50:44,882 INFO L226 Difference]: Without dead ends: 29703 [2019-09-10 03:50:44,882 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:50:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2019-09-10 03:50:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 29636. [2019-09-10 03:50:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29636 states. [2019-09-10 03:50:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29636 states to 29636 states and 41036 transitions. [2019-09-10 03:50:45,364 INFO L78 Accepts]: Start accepts. Automaton has 29636 states and 41036 transitions. Word has length 240 [2019-09-10 03:50:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:45,364 INFO L475 AbstractCegarLoop]: Abstraction has 29636 states and 41036 transitions. [2019-09-10 03:50:45,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29636 states and 41036 transitions. [2019-09-10 03:50:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:45,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:45,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:45,366 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1982300748, now seen corresponding path program 1 times [2019-09-10 03:50:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:45,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:45,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:45,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:50:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:45,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:45,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:45,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:45,461 INFO L87 Difference]: Start difference. First operand 29636 states and 41036 transitions. Second operand 6 states. [2019-09-10 03:50:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:45,626 INFO L93 Difference]: Finished difference Result 30244 states and 41932 transitions. [2019-09-10 03:50:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:45,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:45,732 INFO L225 Difference]: With dead ends: 30244 [2019-09-10 03:50:45,732 INFO L226 Difference]: Without dead ends: 30244 [2019-09-10 03:50:45,733 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:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30244 states. [2019-09-10 03:50:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30244 to 29796. [2019-09-10 03:50:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29796 states. [2019-09-10 03:50:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29796 states to 29796 states and 41164 transitions. [2019-09-10 03:50:46,543 INFO L78 Accepts]: Start accepts. Automaton has 29796 states and 41164 transitions. Word has length 240 [2019-09-10 03:50:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:46,544 INFO L475 AbstractCegarLoop]: Abstraction has 29796 states and 41164 transitions. [2019-09-10 03:50:46,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29796 states and 41164 transitions. [2019-09-10 03:50:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:46,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:46,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:46,546 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1726390326, now seen corresponding path program 1 times [2019-09-10 03:50:46,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:46,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:46,650 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:46,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:46,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:46,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:46,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:46,653 INFO L87 Difference]: Start difference. First operand 29796 states and 41164 transitions. Second operand 4 states. [2019-09-10 03:50:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:47,260 INFO L93 Difference]: Finished difference Result 59175 states and 82240 transitions. [2019-09-10 03:50:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:47,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:47,427 INFO L225 Difference]: With dead ends: 59175 [2019-09-10 03:50:47,427 INFO L226 Difference]: Without dead ends: 59175 [2019-09-10 03:50:47,428 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:50:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59175 states. [2019-09-10 03:50:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59175 to 59044. [2019-09-10 03:50:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59044 states. [2019-09-10 03:50:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59044 states to 59044 states and 82110 transitions. [2019-09-10 03:50:49,261 INFO L78 Accepts]: Start accepts. Automaton has 59044 states and 82110 transitions. Word has length 240 [2019-09-10 03:50:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:49,261 INFO L475 AbstractCegarLoop]: Abstraction has 59044 states and 82110 transitions. [2019-09-10 03:50:49,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59044 states and 82110 transitions. [2019-09-10 03:50:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:49,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:49,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:49,263 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1271484245, now seen corresponding path program 1 times [2019-09-10 03:50:49,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:49,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:49,348 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:49,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:49,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:49,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:49,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:49,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:49,350 INFO L87 Difference]: Start difference. First operand 59044 states and 82110 transitions. Second operand 6 states. [2019-09-10 03:50:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:49,656 INFO L93 Difference]: Finished difference Result 60068 states and 83582 transitions. [2019-09-10 03:50:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:49,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:49,833 INFO L225 Difference]: With dead ends: 60068 [2019-09-10 03:50:49,834 INFO L226 Difference]: Without dead ends: 60068 [2019-09-10 03:50:49,834 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:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60068 states. [2019-09-10 03:50:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60068 to 59364. [2019-09-10 03:50:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59364 states. [2019-09-10 03:50:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59364 states to 59364 states and 82366 transitions. [2019-09-10 03:50:50,950 INFO L78 Accepts]: Start accepts. Automaton has 59364 states and 82366 transitions. Word has length 240 [2019-09-10 03:50:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:50,950 INFO L475 AbstractCegarLoop]: Abstraction has 59364 states and 82366 transitions. [2019-09-10 03:50:50,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 59364 states and 82366 transitions. [2019-09-10 03:50:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:50,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:50,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:50,952 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2110517907, now seen corresponding path program 1 times [2019-09-10 03:50:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:50,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:50,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:51,043 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:51,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:50:51,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:51,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:50:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:50:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:50:51,045 INFO L87 Difference]: Start difference. First operand 59364 states and 82366 transitions. Second operand 4 states. [2019-09-10 03:50:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:53,710 INFO L93 Difference]: Finished difference Result 117927 states and 165334 transitions. [2019-09-10 03:50:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:50:53,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:50:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:53,914 INFO L225 Difference]: With dead ends: 117927 [2019-09-10 03:50:53,914 INFO L226 Difference]: Without dead ends: 117927 [2019-09-10 03:50:53,915 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:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117927 states. [2019-09-10 03:50:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117927 to 117668. [2019-09-10 03:50:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117668 states. [2019-09-10 03:50:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117668 states to 117668 states and 165076 transitions. [2019-09-10 03:50:55,475 INFO L78 Accepts]: Start accepts. Automaton has 117668 states and 165076 transitions. Word has length 240 [2019-09-10 03:50:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:55,475 INFO L475 AbstractCegarLoop]: Abstraction has 117668 states and 165076 transitions. [2019-09-10 03:50:55,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:50:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 117668 states and 165076 transitions. [2019-09-10 03:50:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:50:55,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:55,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:50:55,477 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2043349868, now seen corresponding path program 1 times [2019-09-10 03:50:55,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:55,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:55,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:55,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:55,566 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:55,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:55,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:55,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:55,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:55,568 INFO L87 Difference]: Start difference. First operand 117668 states and 165076 transitions. Second operand 6 states. [2019-09-10 03:50:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:56,109 INFO L93 Difference]: Finished difference Result 119332 states and 167380 transitions. [2019-09-10 03:50:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:56,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:50:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:56,375 INFO L225 Difference]: With dead ends: 119332 [2019-09-10 03:50:56,375 INFO L226 Difference]: Without dead ends: 119332 [2019-09-10 03:50:56,376 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:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119332 states. [2019-09-10 03:51:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119332 to 118308. [2019-09-10 03:51:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118308 states. [2019-09-10 03:51:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118308 states to 118308 states and 165588 transitions. [2019-09-10 03:51:00,921 INFO L78 Accepts]: Start accepts. Automaton has 118308 states and 165588 transitions. Word has length 240 [2019-09-10 03:51:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:00,921 INFO L475 AbstractCegarLoop]: Abstraction has 118308 states and 165588 transitions. [2019-09-10 03:51:00,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:51:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 118308 states and 165588 transitions. [2019-09-10 03:51:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:51:00,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:00,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:51:00,923 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:00,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1758991254, now seen corresponding path program 1 times [2019-09-10 03:51:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:00,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:01,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:01,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:51:01,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:01,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:51:01,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:51:01,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:51:01,022 INFO L87 Difference]: Start difference. First operand 118308 states and 165588 transitions. Second operand 4 states. [2019-09-10 03:51:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:02,615 INFO L93 Difference]: Finished difference Result 235047 states and 334616 transitions. [2019-09-10 03:51:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:51:02,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:51:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:03,210 INFO L225 Difference]: With dead ends: 235047 [2019-09-10 03:51:03,210 INFO L226 Difference]: Without dead ends: 235047 [2019-09-10 03:51:03,210 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:51:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235047 states. [2019-09-10 03:51:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235047 to 234532. [2019-09-10 03:51:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234532 states. [2019-09-10 03:51:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234532 states to 234532 states and 334102 transitions. [2019-09-10 03:51:15,171 INFO L78 Accepts]: Start accepts. Automaton has 234532 states and 334102 transitions. Word has length 240 [2019-09-10 03:51:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:15,172 INFO L475 AbstractCegarLoop]: Abstraction has 234532 states and 334102 transitions. [2019-09-10 03:51:15,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:51:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 234532 states and 334102 transitions. [2019-09-10 03:51:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:51:15,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:15,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:51:15,173 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 581016693, now seen corresponding path program 1 times [2019-09-10 03:51:15,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:15,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:51:15,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:15,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:51:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:51:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:51:15,261 INFO L87 Difference]: Start difference. First operand 234532 states and 334102 transitions. Second operand 6 states. [2019-09-10 03:51:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:16,517 INFO L93 Difference]: Finished difference Result 237092 states and 337430 transitions. [2019-09-10 03:51:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:51:16,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:51:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:17,142 INFO L225 Difference]: With dead ends: 237092 [2019-09-10 03:51:17,142 INFO L226 Difference]: Without dead ends: 237092 [2019-09-10 03:51:17,142 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:51:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237092 states. [2019-09-10 03:51:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237092 to 235812. [2019-09-10 03:51:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235812 states. [2019-09-10 03:51:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235812 states to 235812 states and 335126 transitions. [2019-09-10 03:51:29,624 INFO L78 Accepts]: Start accepts. Automaton has 235812 states and 335126 transitions. Word has length 240 [2019-09-10 03:51:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:29,624 INFO L475 AbstractCegarLoop]: Abstraction has 235812 states and 335126 transitions. [2019-09-10 03:51:29,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:51:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 235812 states and 335126 transitions. [2019-09-10 03:51:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:51:29,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:51:29,626 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash 782840627, now seen corresponding path program 1 times [2019-09-10 03:51:29,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:29,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:29,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:29,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:29,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:51:29,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:29,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:51:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:51:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:51:29,715 INFO L87 Difference]: Start difference. First operand 235812 states and 335126 transitions. Second operand 6 states. [2019-09-10 03:51:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:30,963 INFO L93 Difference]: Finished difference Result 239396 states and 339735 transitions. [2019-09-10 03:51:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:51:30,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 03:51:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:32,249 INFO L225 Difference]: With dead ends: 239396 [2019-09-10 03:51:32,249 INFO L226 Difference]: Without dead ends: 239396 [2019-09-10 03:51:32,250 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:51:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239396 states. [2019-09-10 03:51:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239396 to 238372. [2019-09-10 03:51:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238372 states. [2019-09-10 03:51:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238372 states to 238372 states and 337686 transitions. [2019-09-10 03:51:40,503 INFO L78 Accepts]: Start accepts. Automaton has 238372 states and 337686 transitions. Word has length 240 [2019-09-10 03:51:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:40,503 INFO L475 AbstractCegarLoop]: Abstraction has 238372 states and 337686 transitions. [2019-09-10 03:51:40,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:51:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 238372 states and 337686 transitions. [2019-09-10 03:51:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:51:40,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:40,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:51:40,505 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1245745483, now seen corresponding path program 1 times [2019-09-10 03:51:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:40,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:40,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:51:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:51:40,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:51:40,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:51:40,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:40,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:51:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:51:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:51:40,625 INFO L87 Difference]: Start difference. First operand 238372 states and 337686 transitions. Second operand 5 states. [2019-09-10 03:51:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:51:45,292 INFO L93 Difference]: Finished difference Result 441636 states and 600569 transitions. [2019-09-10 03:51:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:51:45,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:51:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:51:53,557 INFO L225 Difference]: With dead ends: 441636 [2019-09-10 03:51:53,557 INFO L226 Difference]: Without dead ends: 441636 [2019-09-10 03:51:53,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:51:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441636 states. [2019-09-10 03:51:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441636 to 346404. [2019-09-10 03:51:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:51:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 470806 transitions. [2019-09-10 03:51:59,751 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 470806 transitions. Word has length 240 [2019-09-10 03:51:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:51:59,752 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 470806 transitions. [2019-09-10 03:51:59,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:51:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 470806 transitions. [2019-09-10 03:51:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:51:59,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:51:59,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:51:59,754 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:51:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:51:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1598833865, now seen corresponding path program 1 times [2019-09-10 03:51:59,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:51:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:51:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:51:59,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:51:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:00,855 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:52:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:00,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:00,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:00,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:00,857 INFO L87 Difference]: Start difference. First operand 346404 states and 470806 transitions. Second operand 5 states. [2019-09-10 03:52:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:03,068 INFO L93 Difference]: Finished difference Result 346404 states and 469270 transitions. [2019-09-10 03:52:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:52:03,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:52:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:05,321 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:52:05,321 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:52:05,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:52:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:52:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:52:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:52:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 469270 transitions. [2019-09-10 03:52:16,969 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 469270 transitions. Word has length 240 [2019-09-10 03:52:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:16,969 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 469270 transitions. [2019-09-10 03:52:16,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 469270 transitions. [2019-09-10 03:52:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:52:16,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:16,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:52:16,971 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 329438837, now seen corresponding path program 1 times [2019-09-10 03:52:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:16,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:22,766 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:52:22,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:22,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:22,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:22,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:22,768 INFO L87 Difference]: Start difference. First operand 346404 states and 469270 transitions. Second operand 5 states. [2019-09-10 03:52:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:25,580 INFO L93 Difference]: Finished difference Result 346404 states and 467734 transitions. [2019-09-10 03:52:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:52:25,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:52:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:26,439 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:52:26,439 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:52:26,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:52:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:52:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:52:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:52:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 467734 transitions. [2019-09-10 03:52:34,576 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 467734 transitions. Word has length 240 [2019-09-10 03:52:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:34,576 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 467734 transitions. [2019-09-10 03:52:34,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 467734 transitions. [2019-09-10 03:52:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:52:34,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:34,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:52:34,578 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1222925175, now seen corresponding path program 1 times [2019-09-10 03:52:34,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:34,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:34,694 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:52:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:34,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:34,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:34,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:34,696 INFO L87 Difference]: Start difference. First operand 346404 states and 467734 transitions. Second operand 5 states. [2019-09-10 03:52:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:43,326 INFO L93 Difference]: Finished difference Result 346404 states and 466198 transitions. [2019-09-10 03:52:43,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:52:43,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:52:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:44,167 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:52:44,168 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:52:44,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:52:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:52:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:52:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:52:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 466198 transitions. [2019-09-10 03:52:50,223 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 466198 transitions. Word has length 240 [2019-09-10 03:52:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:50,224 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 466198 transitions. [2019-09-10 03:52:50,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:52:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 466198 transitions. [2019-09-10 03:52:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:52:50,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:50,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:52:50,225 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -826462667, now seen corresponding path program 1 times [2019-09-10 03:52:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:50,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:50,317 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:52:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:52:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:52:50,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:50,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:52:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:52:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:52:50,319 INFO L87 Difference]: Start difference. First operand 346404 states and 466198 transitions. Second operand 5 states. [2019-09-10 03:52:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:58,262 INFO L93 Difference]: Finished difference Result 346404 states and 464662 transitions. [2019-09-10 03:52:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:52:58,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:52:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:59,010 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:52:59,011 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:52:59,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:52:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:53:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:53:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:53:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 464662 transitions. [2019-09-10 03:53:05,100 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 464662 transitions. Word has length 240 [2019-09-10 03:53:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:53:05,101 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 464662 transitions. [2019-09-10 03:53:05,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:53:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 464662 transitions. [2019-09-10 03:53:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:53:05,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:53:05,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:53:05,102 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:53:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1723855945, now seen corresponding path program 1 times [2019-09-10 03:53:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:53:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:05,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:05,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:53:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:05,207 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:53:05,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:53:05,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:53:05,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:05,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:53:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:53:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:53:05,209 INFO L87 Difference]: Start difference. First operand 346404 states and 464662 transitions. Second operand 5 states. [2019-09-10 03:53:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:53:13,272 INFO L93 Difference]: Finished difference Result 346404 states and 463126 transitions. [2019-09-10 03:53:13,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:53:13,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:53:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:53:14,001 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:53:14,002 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:53:14,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:53:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:53:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:53:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:53:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 463126 transitions. [2019-09-10 03:53:20,035 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 463126 transitions. Word has length 240 [2019-09-10 03:53:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:53:20,035 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 463126 transitions. [2019-09-10 03:53:20,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:53:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 463126 transitions. [2019-09-10 03:53:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:53:20,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:53:20,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:53:20,036 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:53:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1475709451, now seen corresponding path program 1 times [2019-09-10 03:53:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:53:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:20,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:53:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:53:20,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:53:20,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:53:20,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:20,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:53:20,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:53:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:53:20,123 INFO L87 Difference]: Start difference. First operand 346404 states and 463126 transitions. Second operand 5 states. [2019-09-10 03:53:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:53:23,746 INFO L93 Difference]: Finished difference Result 346404 states and 461590 transitions. [2019-09-10 03:53:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:53:23,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:53:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:53:24,554 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:53:24,555 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:53:24,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:53:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:53:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:53:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:53:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 461590 transitions. [2019-09-10 03:53:36,730 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 461590 transitions. Word has length 240 [2019-09-10 03:53:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:53:36,730 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 461590 transitions. [2019-09-10 03:53:36,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:53:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 461590 transitions. [2019-09-10 03:53:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:53:36,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:53:36,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:53:36,732 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:53:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1447450547, now seen corresponding path program 1 times [2019-09-10 03:53:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:53:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:36,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:53:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:36,830 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:53:36,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:53:36,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:53:36,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:36,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:53:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:53:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:53:36,832 INFO L87 Difference]: Start difference. First operand 346404 states and 461590 transitions. Second operand 5 states. [2019-09-10 03:53:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:53:44,785 INFO L93 Difference]: Finished difference Result 346404 states and 460054 transitions. [2019-09-10 03:53:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:53:44,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:53:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:53:45,567 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:53:45,568 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:53:45,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:53:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:53:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:53:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:53:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 460054 transitions. [2019-09-10 03:53:51,510 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 460054 transitions. Word has length 240 [2019-09-10 03:53:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:53:51,510 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 460054 transitions. [2019-09-10 03:53:51,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:53:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 460054 transitions. [2019-09-10 03:53:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:53:51,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:53:51,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:53:51,512 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:53:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash -397916619, now seen corresponding path program 1 times [2019-09-10 03:53:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:53:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:51,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:51,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:53:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:51,601 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:53:51,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:53:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:53:51,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:51,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:53:51,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:53:51,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:53:51,603 INFO L87 Difference]: Start difference. First operand 346404 states and 460054 transitions. Second operand 5 states. [2019-09-10 03:53:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:53:59,296 INFO L93 Difference]: Finished difference Result 346404 states and 458518 transitions. [2019-09-10 03:53:59,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:53:59,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:53:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:00,123 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:54:00,123 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:54:00,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:54:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:54:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:54:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:54:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 458518 transitions. [2019-09-10 03:54:06,662 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 458518 transitions. Word has length 240 [2019-09-10 03:54:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:06,663 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 458518 transitions. [2019-09-10 03:54:06,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 458518 transitions. [2019-09-10 03:54:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:54:06,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:06,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:06,664 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1427275917, now seen corresponding path program 1 times [2019-09-10 03:54:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:06,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:06,761 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:54:06,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:06,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:06,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:06,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:06,763 INFO L87 Difference]: Start difference. First operand 346404 states and 458518 transitions. Second operand 5 states. [2019-09-10 03:54:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:10,279 INFO L93 Difference]: Finished difference Result 346404 states and 456982 transitions. [2019-09-10 03:54:10,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:10,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:54:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:10,989 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:54:10,990 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:54:10,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:54:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:54:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:54:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:54:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 456982 transitions. [2019-09-10 03:54:23,479 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 456982 transitions. Word has length 240 [2019-09-10 03:54:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:23,480 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 456982 transitions. [2019-09-10 03:54:23,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 456982 transitions. [2019-09-10 03:54:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:54:23,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:23,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:23,481 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -767744395, now seen corresponding path program 1 times [2019-09-10 03:54:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:23,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:23,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:23,581 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:54:23,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:23,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:23,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:23,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:23,583 INFO L87 Difference]: Start difference. First operand 346404 states and 456982 transitions. Second operand 5 states. [2019-09-10 03:54:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:31,941 INFO L93 Difference]: Finished difference Result 346404 states and 455446 transitions. [2019-09-10 03:54:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:31,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:54:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:32,647 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:54:32,648 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:54:32,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:54:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:54:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:54:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:54:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 455446 transitions. [2019-09-10 03:54:38,712 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 455446 transitions. Word has length 240 [2019-09-10 03:54:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:38,713 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 455446 transitions. [2019-09-10 03:54:38,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 455446 transitions. [2019-09-10 03:54:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:54:38,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:38,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:38,714 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1162111181, now seen corresponding path program 1 times [2019-09-10 03:54:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:38,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:38,794 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:54:38,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:38,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:38,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:38,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:38,796 INFO L87 Difference]: Start difference. First operand 346404 states and 455446 transitions. Second operand 5 states. [2019-09-10 03:54:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:42,427 INFO L93 Difference]: Finished difference Result 346404 states and 453910 transitions. [2019-09-10 03:54:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:42,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:54:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:43,160 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:54:43,161 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:54:43,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:54:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:54:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:54:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:54:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 453910 transitions. [2019-09-10 03:54:55,575 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 453910 transitions. Word has length 240 [2019-09-10 03:54:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:55,575 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 453910 transitions. [2019-09-10 03:54:55,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 453910 transitions. [2019-09-10 03:54:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:54:55,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:55,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:55,576 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2006116683, now seen corresponding path program 1 times [2019-09-10 03:54:55,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:55,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:55,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:55,669 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:54:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:55,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:55,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:55,671 INFO L87 Difference]: Start difference. First operand 346404 states and 453910 transitions. Second operand 5 states. [2019-09-10 03:55:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:03,628 INFO L93 Difference]: Finished difference Result 346404 states and 452374 transitions. [2019-09-10 03:55:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:03,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:55:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:04,420 INFO L225 Difference]: With dead ends: 346404 [2019-09-10 03:55:04,421 INFO L226 Difference]: Without dead ends: 346404 [2019-09-10 03:55:04,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 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:55:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346404 states. [2019-09-10 03:55:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346404 to 346404. [2019-09-10 03:55:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346404 states. [2019-09-10 03:55:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346404 states to 346404 states and 452374 transitions. [2019-09-10 03:55:10,439 INFO L78 Accepts]: Start accepts. Automaton has 346404 states and 452374 transitions. Word has length 240 [2019-09-10 03:55:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:10,439 INFO L475 AbstractCegarLoop]: Abstraction has 346404 states and 452374 transitions. [2019-09-10 03:55:10,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 346404 states and 452374 transitions. [2019-09-10 03:55:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:55:10,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:10,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:10,441 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash 44867315, now seen corresponding path program 1 times [2019-09-10 03:55:10,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:10,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:10,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:10,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:10,525 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:55:10,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:10,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:10,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:10,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:10,526 INFO L87 Difference]: Start difference. First operand 346404 states and 452374 transitions. Second operand 5 states. [2019-09-10 03:55:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:22,423 INFO L93 Difference]: Finished difference Result 545061 states and 755648 transitions. [2019-09-10 03:55:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:22,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:55:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:24,544 INFO L225 Difference]: With dead ends: 545061 [2019-09-10 03:55:24,544 INFO L226 Difference]: Without dead ends: 545061 [2019-09-10 03:55:24,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545061 states. [2019-09-10 03:55:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545061 to 435492. [2019-09-10 03:55:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435492 states. [2019-09-10 03:55:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435492 states to 435492 states and 550166 transitions. [2019-09-10 03:55:35,725 INFO L78 Accepts]: Start accepts. Automaton has 435492 states and 550166 transitions. Word has length 240 [2019-09-10 03:55:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:35,725 INFO L475 AbstractCegarLoop]: Abstraction has 435492 states and 550166 transitions. [2019-09-10 03:55:35,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 435492 states and 550166 transitions. [2019-09-10 03:55:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:55:35,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:35,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:35,727 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 319626929, now seen corresponding path program 1 times [2019-09-10 03:55:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:35,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:35,806 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:55:35,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:35,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:35,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:35,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:35,808 INFO L87 Difference]: Start difference. First operand 435492 states and 550166 transitions. Second operand 5 states. [2019-09-10 03:55:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:51,806 INFO L93 Difference]: Finished difference Result 558373 states and 768704 transitions. [2019-09-10 03:55:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:51,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:55:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:53,296 INFO L225 Difference]: With dead ends: 558373 [2019-09-10 03:55:53,296 INFO L226 Difference]: Without dead ends: 558373 [2019-09-10 03:55:53,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558373 states. [2019-09-10 03:56:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558373 to 521764. [2019-09-10 03:56:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521764 states. [2019-09-10 03:56:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521764 states to 521764 states and 643862 transitions. [2019-09-10 03:56:03,319 INFO L78 Accepts]: Start accepts. Automaton has 521764 states and 643862 transitions. Word has length 240 [2019-09-10 03:56:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:03,320 INFO L475 AbstractCegarLoop]: Abstraction has 521764 states and 643862 transitions. [2019-09-10 03:56:03,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 521764 states and 643862 transitions. [2019-09-10 03:56:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:56:03,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:03,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:03,322 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1021226803, now seen corresponding path program 1 times [2019-09-10 03:56:03,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:03,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:03,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:03,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:03,420 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:56:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:03,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:03,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:03,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:03,421 INFO L87 Difference]: Start difference. First operand 521764 states and 643862 transitions. Second operand 5 states. [2019-09-10 03:56:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:14,745 INFO L93 Difference]: Finished difference Result 579493 states and 743323 transitions. [2019-09-10 03:56:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:56:14,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:56:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:17,202 INFO L225 Difference]: With dead ends: 579493 [2019-09-10 03:56:17,202 INFO L226 Difference]: Without dead ends: 579493 [2019-09-10 03:56:17,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:56:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579493 states. [2019-09-10 03:56:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579493 to 562212. [2019-09-10 03:56:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562212 states. [2019-09-10 03:56:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562212 states to 562212 states and 685462 transitions. [2019-09-10 03:56:26,358 INFO L78 Accepts]: Start accepts. Automaton has 562212 states and 685462 transitions. Word has length 240 [2019-09-10 03:56:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:26,359 INFO L475 AbstractCegarLoop]: Abstraction has 562212 states and 685462 transitions. [2019-09-10 03:56:26,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 562212 states and 685462 transitions. [2019-09-10 03:56:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:56:26,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:26,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:26,360 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1043859057, now seen corresponding path program 1 times [2019-09-10 03:56:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:26,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:26,442 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:56:26,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:26,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:26,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:26,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:26,443 INFO L87 Difference]: Start difference. First operand 562212 states and 685462 transitions. Second operand 5 states. [2019-09-10 03:56:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:41,833 INFO L93 Difference]: Finished difference Result 618661 states and 783131 transitions. [2019-09-10 03:56:41,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:56:41,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:56:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:43,799 INFO L225 Difference]: With dead ends: 618661 [2019-09-10 03:56:43,799 INFO L226 Difference]: Without dead ends: 618661 [2019-09-10 03:56:43,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:56:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618661 states. [2019-09-10 03:56:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618661 to 601380. [2019-09-10 03:56:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601380 states. [2019-09-10 03:56:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601380 states to 601380 states and 725270 transitions. [2019-09-10 03:56:54,267 INFO L78 Accepts]: Start accepts. Automaton has 601380 states and 725270 transitions. Word has length 240 [2019-09-10 03:56:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:54,268 INFO L475 AbstractCegarLoop]: Abstraction has 601380 states and 725270 transitions. [2019-09-10 03:56:54,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 601380 states and 725270 transitions. [2019-09-10 03:56:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:56:54,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:54,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:54,269 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1864904845, now seen corresponding path program 1 times [2019-09-10 03:56:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:54,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:54,343 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:56:54,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:54,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:54,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:54,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:54,344 INFO L87 Difference]: Start difference. First operand 601380 states and 725270 transitions. Second operand 5 states. [2019-09-10 03:57:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:57:07,077 INFO L93 Difference]: Finished difference Result 656549 states and 821147 transitions. [2019-09-10 03:57:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:57:07,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:57:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:57:08,492 INFO L225 Difference]: With dead ends: 656549 [2019-09-10 03:57:08,493 INFO L226 Difference]: Without dead ends: 656549 [2019-09-10 03:57:08,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:57:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656549 states. [2019-09-10 03:57:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656549 to 639268. [2019-09-10 03:57:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639268 states. [2019-09-10 03:57:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639268 states to 639268 states and 763286 transitions. [2019-09-10 03:57:20,210 INFO L78 Accepts]: Start accepts. Automaton has 639268 states and 763286 transitions. Word has length 240 [2019-09-10 03:57:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:57:20,210 INFO L475 AbstractCegarLoop]: Abstraction has 639268 states and 763286 transitions. [2019-09-10 03:57:20,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:57:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 639268 states and 763286 transitions. [2019-09-10 03:57:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:57:20,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:57:20,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:57:20,212 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:57:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:57:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1920589361, now seen corresponding path program 1 times [2019-09-10 03:57:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:57:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:57:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:20,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:57:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:57:20,309 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:57:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:57:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:57:20,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:57:20,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:57:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:57:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:57:20,311 INFO L87 Difference]: Start difference. First operand 639268 states and 763286 transitions. Second operand 5 states. [2019-09-10 03:57:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:57:37,694 INFO L93 Difference]: Finished difference Result 693157 states and 857371 transitions. [2019-09-10 03:57:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:57:37,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:57:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:57:39,840 INFO L225 Difference]: With dead ends: 693157 [2019-09-10 03:57:39,840 INFO L226 Difference]: Without dead ends: 693157 [2019-09-10 03:57:39,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:57:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693157 states. [2019-09-10 03:57:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693157 to 675876. [2019-09-10 03:57:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675876 states. [2019-09-10 03:57:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675876 states to 675876 states and 799510 transitions. [2019-09-10 03:57:50,686 INFO L78 Accepts]: Start accepts. Automaton has 675876 states and 799510 transitions. Word has length 240 [2019-09-10 03:57:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:57:50,686 INFO L475 AbstractCegarLoop]: Abstraction has 675876 states and 799510 transitions. [2019-09-10 03:57:50,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:57:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 675876 states and 799510 transitions. [2019-09-10 03:57:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:57:50,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:57:50,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:57:50,688 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:57:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:57:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -451149901, now seen corresponding path program 1 times [2019-09-10 03:57:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:57:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:57:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:50,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:57:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:57:50,783 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:57:50,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:57:50,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:57:50,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:57:50,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:57:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:57:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:57:50,785 INFO L87 Difference]: Start difference. First operand 675876 states and 799510 transitions. Second operand 5 states. [2019-09-10 03:58:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:03,095 INFO L93 Difference]: Finished difference Result 738853 states and 901275 transitions. [2019-09-10 03:58:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:58:03,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:58:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:05,829 INFO L225 Difference]: With dead ends: 738853 [2019-09-10 03:58:05,829 INFO L226 Difference]: Without dead ends: 738853 [2019-09-10 03:58:05,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:58:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738853 states. [2019-09-10 03:58:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738853 to 704292. [2019-09-10 03:58:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704292 states. [2019-09-10 03:58:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704292 states to 704292 states and 824342 transitions. [2019-09-10 03:58:17,748 INFO L78 Accepts]: Start accepts. Automaton has 704292 states and 824342 transitions. Word has length 240 [2019-09-10 03:58:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:17,748 INFO L475 AbstractCegarLoop]: Abstraction has 704292 states and 824342 transitions. [2019-09-10 03:58:17,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:58:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 704292 states and 824342 transitions. [2019-09-10 03:58:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:58:17,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:17,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:58:17,750 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -389110287, now seen corresponding path program 1 times [2019-09-10 03:58:17,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:17,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:17,831 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:58:17,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:58:17,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:17,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:58:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:58:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:17,832 INFO L87 Difference]: Start difference. First operand 704292 states and 824342 transitions. Second operand 5 states. [2019-09-10 03:58:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:35,194 INFO L93 Difference]: Finished difference Result 755621 states and 914843 transitions. [2019-09-10 03:58:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:58:35,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:58:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:37,262 INFO L225 Difference]: With dead ends: 755621 [2019-09-10 03:58:37,262 INFO L226 Difference]: Without dead ends: 755621 [2019-09-10 03:58:37,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:58:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755621 states. [2019-09-10 03:58:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755621 to 738340. [2019-09-10 03:58:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738340 states. [2019-09-10 03:58:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738340 states to 738340 states and 856982 transitions. [2019-09-10 03:58:50,378 INFO L78 Accepts]: Start accepts. Automaton has 738340 states and 856982 transitions. Word has length 240 [2019-09-10 03:58:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:50,378 INFO L475 AbstractCegarLoop]: Abstraction has 738340 states and 856982 transitions. [2019-09-10 03:58:50,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:58:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 738340 states and 856982 transitions. [2019-09-10 03:58:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:58:50,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:50,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:58:50,379 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -523123793, now seen corresponding path program 1 times [2019-09-10 03:58:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:50,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:50,461 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:58:50,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:50,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:58:50,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:50,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:58:50,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:58:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:50,463 INFO L87 Difference]: Start difference. First operand 738340 states and 856982 transitions. Second operand 5 states. [2019-09-10 03:59:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:04,585 INFO L93 Difference]: Finished difference Result 787749 states and 944795 transitions. [2019-09-10 03:59:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:59:04,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:59:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:06,702 INFO L225 Difference]: With dead ends: 787749 [2019-09-10 03:59:06,702 INFO L226 Difference]: Without dead ends: 787749 [2019-09-10 03:59:06,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:59:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787749 states. [2019-09-10 03:59:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787749 to 770468. [2019-09-10 03:59:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770468 states. [2019-09-10 03:59:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770468 states to 770468 states and 886934 transitions. [2019-09-10 03:59:19,908 INFO L78 Accepts]: Start accepts. Automaton has 770468 states and 886934 transitions. Word has length 240 [2019-09-10 03:59:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:19,908 INFO L475 AbstractCegarLoop]: Abstraction has 770468 states and 886934 transitions. [2019-09-10 03:59:19,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:59:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 770468 states and 886934 transitions. [2019-09-10 03:59:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:59:19,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:19,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:59:19,910 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1966405169, now seen corresponding path program 1 times [2019-09-10 03:59:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:19,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:19,994 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:59:19,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:19,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:59:19,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:19,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:59:19,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:59:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:59:19,996 INFO L87 Difference]: Start difference. First operand 770468 states and 886934 transitions. Second operand 5 states. [2019-09-10 03:59:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:34,901 INFO L93 Difference]: Finished difference Result 818597 states and 972955 transitions. [2019-09-10 03:59:34,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:59:34,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-10 03:59:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:36,689 INFO L225 Difference]: With dead ends: 818597 [2019-09-10 03:59:36,690 INFO L226 Difference]: Without dead ends: 818597 [2019-09-10 03:59:36,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:59:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818597 states. [2019-09-10 03:59:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818597 to 801316. [2019-09-10 03:59:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801316 states.