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.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:46:03,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:46:03,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:46:03,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:46:03,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:46:03,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:46:03,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:46:03,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:46:03,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:46:03,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:46:03,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:46:03,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:46:03,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:46:03,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:46:03,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:46:03,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:46:03,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:46:03,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:46:03,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:46:03,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:46:03,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:46:03,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:46:03,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:46:03,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:46:03,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:46:03,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:46:03,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:46:03,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:46:03,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:46:03,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:46:03,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:46:03,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:46:03,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:46:03,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:46:03,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:46:03,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:46:03,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:46:03,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:46:03,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:46:03,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:46:03,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:46:03,592 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:46:03,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:46:03,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:46:03,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:46:03,618 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:46:03,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:46:03,619 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:46:03,619 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:46:03,620 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:46:03,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:46:03,620 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:46:03,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:46:03,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:46:03,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:46:03,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:46:03,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:46:03,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:46:03,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:46:03,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:46:03,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:46:03,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:46:03,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:46:03,625 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:46:03,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:46:03,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:46:03,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:46:03,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:46:03,626 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:46:03,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:46:03,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:46:03,627 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:46:03,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:46:03,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:46:03,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:46:03,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:46:03,682 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:46:03,683 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-09-10 03:46:03,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc7149eb/e45e791346c14f27a72ff12ceafb022e/FLAG95523e703 [2019-09-10 03:46:04,211 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:46:04,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-09-10 03:46:04,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc7149eb/e45e791346c14f27a72ff12ceafb022e/FLAG95523e703 [2019-09-10 03:46:04,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc7149eb/e45e791346c14f27a72ff12ceafb022e [2019-09-10 03:46:04,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:46:04,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:46:04,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:46:04,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:46:04,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:46:04,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:46:04" (1/1) ... [2019-09-10 03:46:04,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3243999d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:04, skipping insertion in model container [2019-09-10 03:46:04,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:46:04" (1/1) ... [2019-09-10 03:46:04,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:46:04,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:46:04,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:46:04,949 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:46:05,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:46:05,141 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:46:05,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05 WrapperNode [2019-09-10 03:46:05,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:46:05,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:46:05,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:46:05,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:46:05,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (1/1) ... [2019-09-10 03:46:05,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:46:05,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:46:05,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:46:05,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:46:05,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (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:46:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:46:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:46:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:46:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:46:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:46:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:46:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:46:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:46:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:46:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:46:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:46:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:46:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:46:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:46:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:46:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:46:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:46:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:46:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:46:06,156 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:46:06,157 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 03:46:06,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:46:06 BoogieIcfgContainer [2019-09-10 03:46:06,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:46:06,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:46:06,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:46:06,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:46:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:46:04" (1/3) ... [2019-09-10 03:46:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@974b4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:46:06, skipping insertion in model container [2019-09-10 03:46:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:46:05" (2/3) ... [2019-09-10 03:46:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@974b4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:46:06, skipping insertion in model container [2019-09-10 03:46:06,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:46:06" (3/3) ... [2019-09-10 03:46:06,170 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-09-10 03:46:06,181 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:46:06,204 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:46:06,224 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:46:06,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:46:06,265 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:46:06,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:46:06,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:46:06,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:46:06,266 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:46:06,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:46:06,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:46:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states. [2019-09-10 03:46:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:06,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:06,352 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] [2019-09-10 03:46:06,354 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1616556766, now seen corresponding path program 1 times [2019-09-10 03:46:06,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:06,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:06,803 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:46:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:06,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:06,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:06,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:06,830 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 4 states. [2019-09-10 03:46:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:07,125 INFO L93 Difference]: Finished difference Result 287 states and 403 transitions. [2019-09-10 03:46:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:07,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 03:46:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:07,142 INFO L225 Difference]: With dead ends: 287 [2019-09-10 03:46:07,143 INFO L226 Difference]: Without dead ends: 280 [2019-09-10 03:46:07,145 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:46:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-10 03:46:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-10 03:46:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 396 transitions. [2019-09-10 03:46:07,218 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 396 transitions. Word has length 150 [2019-09-10 03:46:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:07,220 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 396 transitions. [2019-09-10 03:46:07,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 396 transitions. [2019-09-10 03:46:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:07,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] [2019-09-10 03:46:07,225 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -668504800, now seen corresponding path program 1 times [2019-09-10 03:46:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:07,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:07,431 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:46:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:07,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:07,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:07,448 INFO L87 Difference]: Start difference. First operand 280 states and 396 transitions. Second operand 5 states. [2019-09-10 03:46:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:08,204 INFO L93 Difference]: Finished difference Result 324 states and 474 transitions. [2019-09-10 03:46:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:08,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:08,212 INFO L225 Difference]: With dead ends: 324 [2019-09-10 03:46:08,212 INFO L226 Difference]: Without dead ends: 324 [2019-09-10 03:46:08,213 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:46:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-10 03:46:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-09-10 03:46:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2019-09-10 03:46:08,253 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 150 [2019-09-10 03:46:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:08,254 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2019-09-10 03:46:08,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2019-09-10 03:46:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:08,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:08,257 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] [2019-09-10 03:46:08,257 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 278533086, now seen corresponding path program 1 times [2019-09-10 03:46:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:08,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:08,392 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:46:08,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:08,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:08,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:08,394 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand 5 states. [2019-09-10 03:46:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:09,006 INFO L93 Difference]: Finished difference Result 324 states and 474 transitions. [2019-09-10 03:46:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:09,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:09,010 INFO L225 Difference]: With dead ends: 324 [2019-09-10 03:46:09,010 INFO L226 Difference]: Without dead ends: 324 [2019-09-10 03:46:09,011 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:46:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-10 03:46:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-09-10 03:46:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 394 transitions. [2019-09-10 03:46:09,027 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 394 transitions. Word has length 150 [2019-09-10 03:46:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:09,028 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 394 transitions. [2019-09-10 03:46:09,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 394 transitions. [2019-09-10 03:46:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:09,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:09,030 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] [2019-09-10 03:46:09,031 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1140366688, now seen corresponding path program 1 times [2019-09-10 03:46:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:09,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:09,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:09,159 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:46:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:09,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:09,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:09,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:09,161 INFO L87 Difference]: Start difference. First operand 280 states and 394 transitions. Second operand 5 states. [2019-09-10 03:46:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:09,823 INFO L93 Difference]: Finished difference Result 322 states and 469 transitions. [2019-09-10 03:46:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:09,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:09,828 INFO L225 Difference]: With dead ends: 322 [2019-09-10 03:46:09,828 INFO L226 Difference]: Without dead ends: 322 [2019-09-10 03:46:09,829 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:46:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-10 03:46:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2019-09-10 03:46:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2019-09-10 03:46:09,846 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 150 [2019-09-10 03:46:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:09,847 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2019-09-10 03:46:09,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2019-09-10 03:46:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:09,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:09,851 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] [2019-09-10 03:46:09,852 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -910042210, now seen corresponding path program 1 times [2019-09-10 03:46:09,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:09,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:09,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:46:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:09,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:09,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:09,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:09,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:09,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:09,954 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand 5 states. [2019-09-10 03:46:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:10,556 INFO L93 Difference]: Finished difference Result 320 states and 464 transitions. [2019-09-10 03:46:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:10,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:10,559 INFO L225 Difference]: With dead ends: 320 [2019-09-10 03:46:10,559 INFO L226 Difference]: Without dead ends: 320 [2019-09-10 03:46:10,559 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:46:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-10 03:46:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 280. [2019-09-10 03:46:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2019-09-10 03:46:10,572 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 150 [2019-09-10 03:46:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:10,572 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2019-09-10 03:46:10,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2019-09-10 03:46:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:10,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:10,574 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] [2019-09-10 03:46:10,575 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -421995104, now seen corresponding path program 1 times [2019-09-10 03:46:10,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:10,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:10,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:46:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:10,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:10,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:10,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:10,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:10,652 INFO L87 Difference]: Start difference. First operand 280 states and 392 transitions. Second operand 5 states. [2019-09-10 03:46:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:11,231 INFO L93 Difference]: Finished difference Result 318 states and 459 transitions. [2019-09-10 03:46:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:11,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:11,234 INFO L225 Difference]: With dead ends: 318 [2019-09-10 03:46:11,234 INFO L226 Difference]: Without dead ends: 318 [2019-09-10 03:46:11,235 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:46:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-10 03:46:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-09-10 03:46:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 391 transitions. [2019-09-10 03:46:11,247 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 391 transitions. Word has length 150 [2019-09-10 03:46:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:11,247 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 391 transitions. [2019-09-10 03:46:11,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2019-09-10 03:46:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:11,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:11,250 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] [2019-09-10 03:46:11,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1514630306, now seen corresponding path program 1 times [2019-09-10 03:46:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:11,377 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:46:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:11,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:11,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:11,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:11,379 INFO L87 Difference]: Start difference. First operand 280 states and 391 transitions. Second operand 5 states. [2019-09-10 03:46:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:11,947 INFO L93 Difference]: Finished difference Result 314 states and 450 transitions. [2019-09-10 03:46:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:11,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:11,950 INFO L225 Difference]: With dead ends: 314 [2019-09-10 03:46:11,950 INFO L226 Difference]: Without dead ends: 314 [2019-09-10 03:46:11,950 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:46:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-10 03:46:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-09-10 03:46:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 390 transitions. [2019-09-10 03:46:11,961 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 390 transitions. Word has length 150 [2019-09-10 03:46:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:11,962 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 390 transitions. [2019-09-10 03:46:11,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 390 transitions. [2019-09-10 03:46:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:11,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:11,964 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] [2019-09-10 03:46:11,965 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 937861276, now seen corresponding path program 1 times [2019-09-10 03:46:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:11,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:12,034 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:46:12,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:12,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:12,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:12,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:12,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:12,036 INFO L87 Difference]: Start difference. First operand 280 states and 390 transitions. Second operand 5 states. [2019-09-10 03:46:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:12,612 INFO L93 Difference]: Finished difference Result 343 states and 501 transitions. [2019-09-10 03:46:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:12,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:12,616 INFO L225 Difference]: With dead ends: 343 [2019-09-10 03:46:12,616 INFO L226 Difference]: Without dead ends: 343 [2019-09-10 03:46:12,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-10 03:46:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2019-09-10 03:46:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 389 transitions. [2019-09-10 03:46:12,656 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 389 transitions. Word has length 150 [2019-09-10 03:46:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:12,656 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 389 transitions. [2019-09-10 03:46:12,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 389 transitions. [2019-09-10 03:46:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:12,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:12,659 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] [2019-09-10 03:46:12,659 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash -784141410, now seen corresponding path program 1 times [2019-09-10 03:46:12,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:12,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:12,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:12,754 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:46:12,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:12,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:12,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:12,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:12,758 INFO L87 Difference]: Start difference. First operand 280 states and 389 transitions. Second operand 5 states. [2019-09-10 03:46:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:13,315 INFO L93 Difference]: Finished difference Result 341 states and 496 transitions. [2019-09-10 03:46:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:13,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:13,319 INFO L225 Difference]: With dead ends: 341 [2019-09-10 03:46:13,319 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 03:46:13,320 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:46:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 03:46:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 280. [2019-09-10 03:46:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 388 transitions. [2019-09-10 03:46:13,338 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 388 transitions. Word has length 150 [2019-09-10 03:46:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:13,339 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 388 transitions. [2019-09-10 03:46:13,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 388 transitions. [2019-09-10 03:46:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:13,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46: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] [2019-09-10 03:46:13,343 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1116784548, now seen corresponding path program 1 times [2019-09-10 03:46:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:13,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:13,428 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:46:13,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:13,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:13,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:13,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:13,430 INFO L87 Difference]: Start difference. First operand 280 states and 388 transitions. Second operand 5 states. [2019-09-10 03:46:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:14,000 INFO L93 Difference]: Finished difference Result 339 states and 491 transitions. [2019-09-10 03:46:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:14,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:14,003 INFO L225 Difference]: With dead ends: 339 [2019-09-10 03:46:14,003 INFO L226 Difference]: Without dead ends: 339 [2019-09-10 03:46:14,004 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:46:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-10 03:46:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 280. [2019-09-10 03:46:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 387 transitions. [2019-09-10 03:46:14,015 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 387 transitions. Word has length 150 [2019-09-10 03:46:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:14,016 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 387 transitions. [2019-09-10 03:46:14,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 387 transitions. [2019-09-10 03:46:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:14,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:14,019 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] [2019-09-10 03:46:14,019 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 812147678, now seen corresponding path program 1 times [2019-09-10 03:46:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:14,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:14,091 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:46:14,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:14,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:14,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:14,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:14,093 INFO L87 Difference]: Start difference. First operand 280 states and 387 transitions. Second operand 5 states. [2019-09-10 03:46:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:14,730 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2019-09-10 03:46:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:14,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:14,733 INFO L225 Difference]: With dead ends: 337 [2019-09-10 03:46:14,733 INFO L226 Difference]: Without dead ends: 337 [2019-09-10 03:46:14,734 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:46:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-10 03:46:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2019-09-10 03:46:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 386 transitions. [2019-09-10 03:46:14,744 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 386 transitions. Word has length 150 [2019-09-10 03:46:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:14,745 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 386 transitions. [2019-09-10 03:46:14,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 386 transitions. [2019-09-10 03:46:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:14,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:14,747 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] [2019-09-10 03:46:14,747 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1480933348, now seen corresponding path program 1 times [2019-09-10 03:46:14,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:14,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:14,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:14,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:14,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:14,846 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:46:14,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:14,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:14,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:14,849 INFO L87 Difference]: Start difference. First operand 280 states and 386 transitions. Second operand 5 states. [2019-09-10 03:46:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:15,429 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2019-09-10 03:46:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:15,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:15,433 INFO L225 Difference]: With dead ends: 335 [2019-09-10 03:46:15,433 INFO L226 Difference]: Without dead ends: 335 [2019-09-10 03:46:15,433 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:46:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-10 03:46:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 280. [2019-09-10 03:46:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2019-09-10 03:46:15,446 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 150 [2019-09-10 03:46:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:15,446 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2019-09-10 03:46:15,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2019-09-10 03:46:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:15,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:15,449 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] [2019-09-10 03:46:15,450 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash 246211614, now seen corresponding path program 1 times [2019-09-10 03:46:15,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:15,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:15,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:15,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:15,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:15,547 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:46:15,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:15,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:15,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:15,549 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand 5 states. [2019-09-10 03:46:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:16,188 INFO L93 Difference]: Finished difference Result 333 states and 476 transitions. [2019-09-10 03:46:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:16,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:16,193 INFO L225 Difference]: With dead ends: 333 [2019-09-10 03:46:16,194 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 03:46:16,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:46:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 03:46:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2019-09-10 03:46:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 03:46:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2019-09-10 03:46:16,207 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 150 [2019-09-10 03:46:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:16,208 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2019-09-10 03:46:16,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2019-09-10 03:46:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:16,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:16,214 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] [2019-09-10 03:46:16,214 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash 717567964, now seen corresponding path program 1 times [2019-09-10 03:46:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:16,356 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:46:16,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:16,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:16,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:16,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:16,359 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand 4 states. [2019-09-10 03:46:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:16,737 INFO L93 Difference]: Finished difference Result 527 states and 720 transitions. [2019-09-10 03:46:16,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:16,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 03:46:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:16,741 INFO L225 Difference]: With dead ends: 527 [2019-09-10 03:46:16,742 INFO L226 Difference]: Without dead ends: 527 [2019-09-10 03:46:16,742 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:46:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-10 03:46:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2019-09-10 03:46:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-09-10 03:46:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 716 transitions. [2019-09-10 03:46:16,764 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 716 transitions. Word has length 150 [2019-09-10 03:46:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:16,765 INFO L475 AbstractCegarLoop]: Abstraction has 522 states and 716 transitions. [2019-09-10 03:46:16,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 716 transitions. [2019-09-10 03:46:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:16,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:16,768 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] [2019-09-10 03:46:16,769 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1005027869, now seen corresponding path program 1 times [2019-09-10 03:46:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:16,867 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:46:16,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:16,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:16,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:16,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:16,869 INFO L87 Difference]: Start difference. First operand 522 states and 716 transitions. Second operand 6 states. [2019-09-10 03:46:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:16,912 INFO L93 Difference]: Finished difference Result 547 states and 754 transitions. [2019-09-10 03:46:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:16,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:16,916 INFO L225 Difference]: With dead ends: 547 [2019-09-10 03:46:16,916 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 03:46:16,917 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:46:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 03:46:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2019-09-10 03:46:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-10 03:46:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 720 transitions. [2019-09-10 03:46:16,936 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 720 transitions. Word has length 150 [2019-09-10 03:46:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:16,937 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 720 transitions. [2019-09-10 03:46:16,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 720 transitions. [2019-09-10 03:46:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:16,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:16,940 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] [2019-09-10 03:46:16,940 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2036068767, now seen corresponding path program 1 times [2019-09-10 03:46:16,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:16,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:16,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:16,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:17,038 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:46:17,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:17,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:17,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:17,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:17,040 INFO L87 Difference]: Start difference. First operand 527 states and 720 transitions. Second operand 4 states. [2019-09-10 03:46:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:17,402 INFO L93 Difference]: Finished difference Result 1016 states and 1383 transitions. [2019-09-10 03:46:17,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:17,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 03:46:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:17,410 INFO L225 Difference]: With dead ends: 1016 [2019-09-10 03:46:17,411 INFO L226 Difference]: Without dead ends: 1016 [2019-09-10 03:46:17,411 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:46:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-10 03:46:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1009. [2019-09-10 03:46:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-10 03:46:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1377 transitions. [2019-09-10 03:46:17,456 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1377 transitions. Word has length 150 [2019-09-10 03:46:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:17,456 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1377 transitions. [2019-09-10 03:46:17,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1377 transitions. [2019-09-10 03:46:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:17,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:17,460 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] [2019-09-10 03:46:17,461 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1903302082, now seen corresponding path program 1 times [2019-09-10 03:46:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:17,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:17,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:17,554 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:46:17,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:17,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:17,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:17,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:17,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:17,557 INFO L87 Difference]: Start difference. First operand 1009 states and 1377 transitions. Second operand 6 states. [2019-09-10 03:46:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:17,614 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2019-09-10 03:46:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:17,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:17,623 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 03:46:17,623 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 03:46:17,624 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:46:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 03:46:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1019. [2019-09-10 03:46:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-09-10 03:46:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1385 transitions. [2019-09-10 03:46:17,669 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1385 transitions. Word has length 150 [2019-09-10 03:46:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:17,670 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1385 transitions. [2019-09-10 03:46:17,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1385 transitions. [2019-09-10 03:46:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:17,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:17,675 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] [2019-09-10 03:46:17,675 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -26238852, now seen corresponding path program 1 times [2019-09-10 03:46:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:17,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:17,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:17,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:46:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:17,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:17,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:17,799 INFO L87 Difference]: Start difference. First operand 1019 states and 1385 transitions. Second operand 4 states. [2019-09-10 03:46:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:18,188 INFO L93 Difference]: Finished difference Result 1988 states and 2695 transitions. [2019-09-10 03:46:18,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:18,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 03:46:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:18,205 INFO L225 Difference]: With dead ends: 1988 [2019-09-10 03:46:18,205 INFO L226 Difference]: Without dead ends: 1988 [2019-09-10 03:46:18,206 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:46:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-09-10 03:46:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1977. [2019-09-10 03:46:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-09-10 03:46:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2685 transitions. [2019-09-10 03:46:18,331 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2685 transitions. Word has length 150 [2019-09-10 03:46:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:18,331 INFO L475 AbstractCegarLoop]: Abstraction has 1977 states and 2685 transitions. [2019-09-10 03:46:18,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2685 transitions. [2019-09-10 03:46:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:18,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:18,336 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] [2019-09-10 03:46:18,336 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1511479043, now seen corresponding path program 1 times [2019-09-10 03:46:18,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:18,422 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:46:18,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:18,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:18,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:18,426 INFO L87 Difference]: Start difference. First operand 1977 states and 2685 transitions. Second operand 6 states. [2019-09-10 03:46:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:18,483 INFO L93 Difference]: Finished difference Result 2053 states and 2797 transitions. [2019-09-10 03:46:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:18,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:18,499 INFO L225 Difference]: With dead ends: 2053 [2019-09-10 03:46:18,499 INFO L226 Difference]: Without dead ends: 2053 [2019-09-10 03:46:18,502 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:46:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-09-10 03:46:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1997. [2019-09-10 03:46:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-09-10 03:46:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2701 transitions. [2019-09-10 03:46:18,586 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2701 transitions. Word has length 150 [2019-09-10 03:46:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:18,589 INFO L475 AbstractCegarLoop]: Abstraction has 1997 states and 2701 transitions. [2019-09-10 03:46:18,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2701 transitions. [2019-09-10 03:46:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:18,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:18,593 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] [2019-09-10 03:46:18,593 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1725650175, now seen corresponding path program 1 times [2019-09-10 03:46:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:18,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:18,700 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:46:18,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:18,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:18,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:18,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:18,703 INFO L87 Difference]: Start difference. First operand 1997 states and 2701 transitions. Second operand 6 states. [2019-09-10 03:46:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:18,775 INFO L93 Difference]: Finished difference Result 2125 states and 2894 transitions. [2019-09-10 03:46:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:18,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:18,791 INFO L225 Difference]: With dead ends: 2125 [2019-09-10 03:46:18,791 INFO L226 Difference]: Without dead ends: 2125 [2019-09-10 03:46:18,792 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:46:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-09-10 03:46:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2037. [2019-09-10 03:46:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-09-10 03:46:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2741 transitions. [2019-09-10 03:46:18,881 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2741 transitions. Word has length 150 [2019-09-10 03:46:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:18,882 INFO L475 AbstractCegarLoop]: Abstraction has 2037 states and 2741 transitions. [2019-09-10 03:46:18,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2741 transitions. [2019-09-10 03:46:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:18,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:18,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] [2019-09-10 03:46:18,887 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1802550973, now seen corresponding path program 1 times [2019-09-10 03:46:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:18,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:18,988 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:46:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:18,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:18,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:18,991 INFO L87 Difference]: Start difference. First operand 2037 states and 2741 transitions. Second operand 4 states. [2019-09-10 03:46:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:19,255 INFO L93 Difference]: Finished difference Result 4000 states and 5377 transitions. [2019-09-10 03:46:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:19,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 03:46:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:19,285 INFO L225 Difference]: With dead ends: 4000 [2019-09-10 03:46:19,285 INFO L226 Difference]: Without dead ends: 4000 [2019-09-10 03:46:19,285 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:46:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2019-09-10 03:46:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3981. [2019-09-10 03:46:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2019-09-10 03:46:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 5359 transitions. [2019-09-10 03:46:19,407 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 5359 transitions. Word has length 150 [2019-09-10 03:46:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:19,408 INFO L475 AbstractCegarLoop]: Abstraction has 3981 states and 5359 transitions. [2019-09-10 03:46:19,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 5359 transitions. [2019-09-10 03:46:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:19,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:19,409 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] [2019-09-10 03:46:19,410 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1354787458, now seen corresponding path program 1 times [2019-09-10 03:46:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:19,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:19,540 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:46:19,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:19,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:19,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:19,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:19,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:19,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:19,541 INFO L87 Difference]: Start difference. First operand 3981 states and 5359 transitions. Second operand 6 states. [2019-09-10 03:46:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:19,588 INFO L93 Difference]: Finished difference Result 4085 states and 5503 transitions. [2019-09-10 03:46:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:19,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:19,610 INFO L225 Difference]: With dead ends: 4085 [2019-09-10 03:46:19,610 INFO L226 Difference]: Without dead ends: 4085 [2019-09-10 03:46:19,611 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:46:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-09-10 03:46:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4021. [2019-09-10 03:46:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-09-10 03:46:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5391 transitions. [2019-09-10 03:46:19,726 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5391 transitions. Word has length 150 [2019-09-10 03:46:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:19,727 INFO L475 AbstractCegarLoop]: Abstraction has 4021 states and 5391 transitions. [2019-09-10 03:46:19,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5391 transitions. [2019-09-10 03:46:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:19,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:19,728 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] [2019-09-10 03:46:19,728 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1772184064, now seen corresponding path program 1 times [2019-09-10 03:46:19,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:19,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:19,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:46:19,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:19,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:19,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:19,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:19,796 INFO L87 Difference]: Start difference. First operand 4021 states and 5391 transitions. Second operand 6 states. [2019-09-10 03:46:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:19,848 INFO L93 Difference]: Finished difference Result 4181 states and 5616 transitions. [2019-09-10 03:46:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:19,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:19,884 INFO L225 Difference]: With dead ends: 4181 [2019-09-10 03:46:19,884 INFO L226 Difference]: Without dead ends: 4181 [2019-09-10 03:46:19,885 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:46:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-09-10 03:46:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4101. [2019-09-10 03:46:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-09-10 03:46:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5471 transitions. [2019-09-10 03:46:20,013 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5471 transitions. Word has length 150 [2019-09-10 03:46:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:20,013 INFO L475 AbstractCegarLoop]: Abstraction has 4101 states and 5471 transitions. [2019-09-10 03:46:20,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5471 transitions. [2019-09-10 03:46:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:20,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:20,015 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] [2019-09-10 03:46:20,015 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash -896165058, now seen corresponding path program 1 times [2019-09-10 03:46:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:20,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:20,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:20,101 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:46:20,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:20,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:46:20,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:20,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:46:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:46:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:46:20,104 INFO L87 Difference]: Start difference. First operand 4101 states and 5471 transitions. Second operand 6 states. [2019-09-10 03:46:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:20,153 INFO L93 Difference]: Finished difference Result 4213 states and 5616 transitions. [2019-09-10 03:46:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:20,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 03:46:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:20,173 INFO L225 Difference]: With dead ends: 4213 [2019-09-10 03:46:20,174 INFO L226 Difference]: Without dead ends: 4213 [2019-09-10 03:46:20,178 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:46:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-09-10 03:46:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4181. [2019-09-10 03:46:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-09-10 03:46:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5551 transitions. [2019-09-10 03:46:20,290 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5551 transitions. Word has length 150 [2019-09-10 03:46:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:20,293 INFO L475 AbstractCegarLoop]: Abstraction has 4181 states and 5551 transitions. [2019-09-10 03:46:20,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:46:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5551 transitions. [2019-09-10 03:46:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:20,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:20,296 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] [2019-09-10 03:46:20,296 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2678720, now seen corresponding path program 1 times [2019-09-10 03:46:20,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:20,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:20,407 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:46:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:20,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:20,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:20,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:20,408 INFO L87 Difference]: Start difference. First operand 4181 states and 5551 transitions. Second operand 5 states. [2019-09-10 03:46:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:21,348 INFO L93 Difference]: Finished difference Result 6125 states and 8080 transitions. [2019-09-10 03:46:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:46:21,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:21,371 INFO L225 Difference]: With dead ends: 6125 [2019-09-10 03:46:21,371 INFO L226 Difference]: Without dead ends: 6125 [2019-09-10 03:46:21,371 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:46:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-09-10 03:46:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5757. [2019-09-10 03:46:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-09-10 03:46:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7407 transitions. [2019-09-10 03:46:21,505 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7407 transitions. Word has length 150 [2019-09-10 03:46:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:21,505 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7407 transitions. [2019-09-10 03:46:21,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7407 transitions. [2019-09-10 03:46:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:21,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:21,507 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] [2019-09-10 03:46:21,507 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 420968002, now seen corresponding path program 1 times [2019-09-10 03:46:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:21,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:21,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:46:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:21,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:21,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:21,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:21,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:21,587 INFO L87 Difference]: Start difference. First operand 5757 states and 7407 transitions. Second operand 5 states. [2019-09-10 03:46:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:22,148 INFO L93 Difference]: Finished difference Result 5757 states and 7367 transitions. [2019-09-10 03:46:22,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:22,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:22,176 INFO L225 Difference]: With dead ends: 5757 [2019-09-10 03:46:22,176 INFO L226 Difference]: Without dead ends: 5757 [2019-09-10 03:46:22,177 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:46:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-09-10 03:46:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-09-10 03:46:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-09-10 03:46:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7367 transitions. [2019-09-10 03:46:22,290 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7367 transitions. Word has length 150 [2019-09-10 03:46:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:22,291 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7367 transitions. [2019-09-10 03:46:22,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7367 transitions. [2019-09-10 03:46:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:22,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:22,293 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] [2019-09-10 03:46:22,293 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash -950839296, now seen corresponding path program 1 times [2019-09-10 03:46:22,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:22,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:22,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:22,394 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:46:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:22,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:22,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:22,395 INFO L87 Difference]: Start difference. First operand 5757 states and 7367 transitions. Second operand 5 states. [2019-09-10 03:46:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:22,944 INFO L93 Difference]: Finished difference Result 5757 states and 7327 transitions. [2019-09-10 03:46:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:22,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:22,963 INFO L225 Difference]: With dead ends: 5757 [2019-09-10 03:46:22,964 INFO L226 Difference]: Without dead ends: 5757 [2019-09-10 03:46:22,964 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:46:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-09-10 03:46:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-09-10 03:46:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-09-10 03:46:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7327 transitions. [2019-09-10 03:46:23,077 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7327 transitions. Word has length 150 [2019-09-10 03:46:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:23,079 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7327 transitions. [2019-09-10 03:46:23,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7327 transitions. [2019-09-10 03:46:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:23,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:23,080 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] [2019-09-10 03:46:23,081 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:23,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1980198594, now seen corresponding path program 1 times [2019-09-10 03:46:23,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:23,155 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:46:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:23,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:23,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:23,157 INFO L87 Difference]: Start difference. First operand 5757 states and 7327 transitions. Second operand 5 states. [2019-09-10 03:46:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:23,655 INFO L93 Difference]: Finished difference Result 5757 states and 7287 transitions. [2019-09-10 03:46:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:23,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:23,673 INFO L225 Difference]: With dead ends: 5757 [2019-09-10 03:46:23,673 INFO L226 Difference]: Without dead ends: 5757 [2019-09-10 03:46:23,674 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:46:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-09-10 03:46:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-09-10 03:46:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-09-10 03:46:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7287 transitions. [2019-09-10 03:46:23,776 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7287 transitions. Word has length 150 [2019-09-10 03:46:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:23,776 INFO L475 AbstractCegarLoop]: Abstraction has 5757 states and 7287 transitions. [2019-09-10 03:46:23,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7287 transitions. [2019-09-10 03:46:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:23,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:23,778 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] [2019-09-10 03:46:23,778 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1320667072, now seen corresponding path program 1 times [2019-09-10 03:46:23,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:23,873 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:46:23,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:23,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:23,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:23,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:23,874 INFO L87 Difference]: Start difference. First operand 5757 states and 7287 transitions. Second operand 5 states. [2019-09-10 03:46:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:24,588 INFO L93 Difference]: Finished difference Result 7967 states and 10094 transitions. [2019-09-10 03:46:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:24,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:24,612 INFO L225 Difference]: With dead ends: 7967 [2019-09-10 03:46:24,612 INFO L226 Difference]: Without dead ends: 7967 [2019-09-10 03:46:24,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:46:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2019-09-10 03:46:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7671. [2019-09-10 03:46:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-09-10 03:46:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9517 transitions. [2019-09-10 03:46:24,744 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9517 transitions. Word has length 150 [2019-09-10 03:46:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 7671 states and 9517 transitions. [2019-09-10 03:46:24,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9517 transitions. [2019-09-10 03:46:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:24,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:24,746 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] [2019-09-10 03:46:24,747 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1715033858, now seen corresponding path program 1 times [2019-09-10 03:46:24,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:24,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:24,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:24,819 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:46:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:24,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:24,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:24,821 INFO L87 Difference]: Start difference. First operand 7671 states and 9517 transitions. Second operand 5 states. [2019-09-10 03:46:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:25,388 INFO L93 Difference]: Finished difference Result 7671 states and 9461 transitions. [2019-09-10 03:46:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:46:25,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:25,408 INFO L225 Difference]: With dead ends: 7671 [2019-09-10 03:46:25,408 INFO L226 Difference]: Without dead ends: 7671 [2019-09-10 03:46:25,409 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:46:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states. [2019-09-10 03:46:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7671 to 7671. [2019-09-10 03:46:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-09-10 03:46:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9461 transitions. [2019-09-10 03:46:25,529 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9461 transitions. Word has length 150 [2019-09-10 03:46:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:25,530 INFO L475 AbstractCegarLoop]: Abstraction has 7671 states and 9461 transitions. [2019-09-10 03:46:25,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9461 transitions. [2019-09-10 03:46:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:25,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:25,532 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] [2019-09-10 03:46:25,532 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1735927936, now seen corresponding path program 1 times [2019-09-10 03:46:25,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:25,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:25,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:25,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:25,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:25,613 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:46:25,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:25,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:25,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:25,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:25,615 INFO L87 Difference]: Start difference. First operand 7671 states and 9461 transitions. Second operand 5 states. [2019-09-10 03:46:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:26,471 INFO L93 Difference]: Finished difference Result 8547 states and 10501 transitions. [2019-09-10 03:46:26,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:26,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:26,492 INFO L225 Difference]: With dead ends: 8547 [2019-09-10 03:46:26,492 INFO L226 Difference]: Without dead ends: 8547 [2019-09-10 03:46:26,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:46:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8547 states. [2019-09-10 03:46:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8547 to 8543. [2019-09-10 03:46:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8543 states. [2019-09-10 03:46:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8543 states to 8543 states and 10497 transitions. [2019-09-10 03:46:26,624 INFO L78 Accepts]: Start accepts. Automaton has 8543 states and 10497 transitions. Word has length 150 [2019-09-10 03:46:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:26,624 INFO L475 AbstractCegarLoop]: Abstraction has 8543 states and 10497 transitions. [2019-09-10 03:46:26,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 8543 states and 10497 transitions. [2019-09-10 03:46:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:26,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:26,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] [2019-09-10 03:46:26,626 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -508055362, now seen corresponding path program 1 times [2019-09-10 03:46:26,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:26,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:26,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:46:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:26,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:26,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:26,717 INFO L87 Difference]: Start difference. First operand 8543 states and 10497 transitions. Second operand 5 states. [2019-09-10 03:46:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:27,685 INFO L93 Difference]: Finished difference Result 9659 states and 12081 transitions. [2019-09-10 03:46:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:27,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:27,714 INFO L225 Difference]: With dead ends: 9659 [2019-09-10 03:46:27,715 INFO L226 Difference]: Without dead ends: 9659 [2019-09-10 03:46:27,717 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:46:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9659 states. [2019-09-10 03:46:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9659 to 9167. [2019-09-10 03:46:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9167 states. [2019-09-10 03:46:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9167 states to 9167 states and 11093 transitions. [2019-09-10 03:46:27,944 INFO L78 Accepts]: Start accepts. Automaton has 9167 states and 11093 transitions. Word has length 150 [2019-09-10 03:46:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:27,945 INFO L475 AbstractCegarLoop]: Abstraction has 9167 states and 11093 transitions. [2019-09-10 03:46:27,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9167 states and 11093 transitions. [2019-09-10 03:46:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:27,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:27,948 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] [2019-09-10 03:46:27,949 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash -580441920, now seen corresponding path program 1 times [2019-09-10 03:46:27,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:27,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:28,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:46:28,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:28,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:28,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:28,126 INFO L87 Difference]: Start difference. First operand 9167 states and 11093 transitions. Second operand 5 states. [2019-09-10 03:46:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:28,855 INFO L93 Difference]: Finished difference Result 10479 states and 12861 transitions. [2019-09-10 03:46:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:28,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:28,887 INFO L225 Difference]: With dead ends: 10479 [2019-09-10 03:46:28,887 INFO L226 Difference]: Without dead ends: 10479 [2019-09-10 03:46:28,889 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:46:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10479 states. [2019-09-10 03:46:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10479 to 9615. [2019-09-10 03:46:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-09-10 03:46:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 11445 transitions. [2019-09-10 03:46:29,118 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 11445 transitions. Word has length 150 [2019-09-10 03:46:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:29,118 INFO L475 AbstractCegarLoop]: Abstraction has 9615 states and 11445 transitions. [2019-09-10 03:46:29,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 11445 transitions. [2019-09-10 03:46:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:29,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:29,121 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] [2019-09-10 03:46:29,122 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash -305682306, now seen corresponding path program 1 times [2019-09-10 03:46:29,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:29,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:29,245 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:46:29,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:29,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:29,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:29,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:29,248 INFO L87 Difference]: Start difference. First operand 9615 states and 11445 transitions. Second operand 5 states. [2019-09-10 03:46:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:30,244 INFO L93 Difference]: Finished difference Result 10651 states and 12881 transitions. [2019-09-10 03:46:30,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:30,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:30,275 INFO L225 Difference]: With dead ends: 10651 [2019-09-10 03:46:30,275 INFO L226 Difference]: Without dead ends: 10651 [2019-09-10 03:46:30,275 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:46:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10651 states. [2019-09-10 03:46:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10651 to 10003. [2019-09-10 03:46:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10003 states. [2019-09-10 03:46:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 11713 transitions. [2019-09-10 03:46:30,623 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 11713 transitions. Word has length 150 [2019-09-10 03:46:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:30,623 INFO L475 AbstractCegarLoop]: Abstraction has 10003 states and 11713 transitions. [2019-09-10 03:46:30,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 11713 transitions. [2019-09-10 03:46:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:30,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:30,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] [2019-09-10 03:46:30,626 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash -283050052, now seen corresponding path program 1 times [2019-09-10 03:46:30,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:30,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:30,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:30,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:30,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:30,743 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:46:30,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:30,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:46:30,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:30,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:46:30,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:46:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:46:30,745 INFO L87 Difference]: Start difference. First operand 10003 states and 11713 transitions. Second operand 5 states. [2019-09-10 03:46:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:31,688 INFO L93 Difference]: Finished difference Result 12027 states and 14700 transitions. [2019-09-10 03:46:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:46:31,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 03:46:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:31,722 INFO L225 Difference]: With dead ends: 12027 [2019-09-10 03:46:31,722 INFO L226 Difference]: Without dead ends: 12027 [2019-09-10 03:46:31,723 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:46:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12027 states. [2019-09-10 03:46:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12027 to 10907. [2019-09-10 03:46:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10907 states. [2019-09-10 03:46:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 12529 transitions. [2019-09-10 03:46:31,999 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 12529 transitions. Word has length 150 [2019-09-10 03:46:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:31,999 INFO L475 AbstractCegarLoop]: Abstraction has 10907 states and 12529 transitions. [2019-09-10 03:46:32,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:46:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 12529 transitions. [2019-09-10 03:46:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:46:32,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:32,002 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] [2019-09-10 03:46:32,003 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1103153342, now seen corresponding path program 1 times [2019-09-10 03:46:32,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:32,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:32,096 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:46:32,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:32,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:46:32,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:32,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:46:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:46:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:32,100 INFO L87 Difference]: Start difference. First operand 10907 states and 12529 transitions. Second operand 3 states. [2019-09-10 03:46:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:32,210 INFO L93 Difference]: Finished difference Result 20923 states and 24152 transitions. [2019-09-10 03:46:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:46:32,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 03:46:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:32,254 INFO L225 Difference]: With dead ends: 20923 [2019-09-10 03:46:32,254 INFO L226 Difference]: Without dead ends: 20923 [2019-09-10 03:46:32,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20923 states. [2019-09-10 03:46:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20923 to 20920. [2019-09-10 03:46:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20920 states. [2019-09-10 03:46:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20920 states to 20920 states and 24150 transitions. [2019-09-10 03:46:32,717 INFO L78 Accepts]: Start accepts. Automaton has 20920 states and 24150 transitions. Word has length 150 [2019-09-10 03:46:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:32,717 INFO L475 AbstractCegarLoop]: Abstraction has 20920 states and 24150 transitions. [2019-09-10 03:46:32,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:46:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20920 states and 24150 transitions. [2019-09-10 03:46:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 03:46:32,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:32,720 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] [2019-09-10 03:46:32,720 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1244561766, now seen corresponding path program 1 times [2019-09-10 03:46:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:32,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:32,785 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:46:32,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:32,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:46:32,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:32,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:46:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:46:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:32,788 INFO L87 Difference]: Start difference. First operand 20920 states and 24150 transitions. Second operand 3 states. [2019-09-10 03:46:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:32,959 INFO L93 Difference]: Finished difference Result 41132 states and 48625 transitions. [2019-09-10 03:46:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:46:32,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 03:46:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:33,062 INFO L225 Difference]: With dead ends: 41132 [2019-09-10 03:46:33,062 INFO L226 Difference]: Without dead ends: 41132 [2019-09-10 03:46:33,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41132 states. [2019-09-10 03:46:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41132 to 41132. [2019-09-10 03:46:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41132 states. [2019-09-10 03:46:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41132 states to 41132 states and 48625 transitions. [2019-09-10 03:46:33,810 INFO L78 Accepts]: Start accepts. Automaton has 41132 states and 48625 transitions. Word has length 151 [2019-09-10 03:46:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:33,813 INFO L475 AbstractCegarLoop]: Abstraction has 41132 states and 48625 transitions. [2019-09-10 03:46:33,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:46:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41132 states and 48625 transitions. [2019-09-10 03:46:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 03:46:33,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:33,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:46:33,822 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1157336766, now seen corresponding path program 1 times [2019-09-10 03:46:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:33,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:33,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:33,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:46:34,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:34,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:46:34,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:34,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:46:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:46:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:34,799 INFO L87 Difference]: Start difference. First operand 41132 states and 48625 transitions. Second operand 3 states. [2019-09-10 03:46:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:35,180 INFO L93 Difference]: Finished difference Result 81786 states and 97974 transitions. [2019-09-10 03:46:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:46:35,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 03:46:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:35,417 INFO L225 Difference]: With dead ends: 81786 [2019-09-10 03:46:35,417 INFO L226 Difference]: Without dead ends: 61528 [2019-09-10 03:46:35,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61528 states. [2019-09-10 03:46:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61528 to 61528. [2019-09-10 03:46:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61528 states. [2019-09-10 03:46:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61528 states to 61528 states and 73148 transitions. [2019-09-10 03:46:36,877 INFO L78 Accepts]: Start accepts. Automaton has 61528 states and 73148 transitions. Word has length 175 [2019-09-10 03:46:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:36,877 INFO L475 AbstractCegarLoop]: Abstraction has 61528 states and 73148 transitions. [2019-09-10 03:46:36,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:46:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 61528 states and 73148 transitions. [2019-09-10 03:46:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 03:46:36,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:36,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,933 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1003799114, now seen corresponding path program 1 times [2019-09-10 03:46:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:36,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:46:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:37,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:46:37,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:37,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:46:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:46:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:37,017 INFO L87 Difference]: Start difference. First operand 61528 states and 73148 transitions. Second operand 3 states. [2019-09-10 03:46:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:37,542 INFO L93 Difference]: Finished difference Result 105393 states and 128476 transitions. [2019-09-10 03:46:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:46:37,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-10 03:46:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:37,909 INFO L225 Difference]: With dead ends: 105393 [2019-09-10 03:46:37,910 INFO L226 Difference]: Without dead ends: 105393 [2019-09-10 03:46:37,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:46:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105393 states. [2019-09-10 03:46:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105393 to 105390. [2019-09-10 03:46:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105390 states. [2019-09-10 03:46:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105390 states to 105390 states and 128474 transitions. [2019-09-10 03:46:41,508 INFO L78 Accepts]: Start accepts. Automaton has 105390 states and 128474 transitions. Word has length 255 [2019-09-10 03:46:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:41,509 INFO L475 AbstractCegarLoop]: Abstraction has 105390 states and 128474 transitions. [2019-09-10 03:46:41,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:46:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 105390 states and 128474 transitions. [2019-09-10 03:46:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 03:46:41,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:41,646 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,646 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1211931379, now seen corresponding path program 1 times [2019-09-10 03:46:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:41,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:41,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-10 03:46:41,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:46:41,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:46:41,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:41,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:46:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:46:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:46:41,717 INFO L87 Difference]: Start difference. First operand 105390 states and 128474 transitions. Second operand 4 states. [2019-09-10 03:46:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:42,126 INFO L93 Difference]: Finished difference Result 82291 states and 99146 transitions. [2019-09-10 03:46:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:46:42,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-10 03:46:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:42,281 INFO L225 Difference]: With dead ends: 82291 [2019-09-10 03:46:42,281 INFO L226 Difference]: Without dead ends: 82291 [2019-09-10 03:46:42,282 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:46:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82291 states. [2019-09-10 03:46:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82291 to 81072. [2019-09-10 03:46:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81072 states. [2019-09-10 03:46:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81072 states to 81072 states and 97835 transitions. [2019-09-10 03:46:45,277 INFO L78 Accepts]: Start accepts. Automaton has 81072 states and 97835 transitions. Word has length 256 [2019-09-10 03:46:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:45,277 INFO L475 AbstractCegarLoop]: Abstraction has 81072 states and 97835 transitions. [2019-09-10 03:46:45,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:46:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 81072 states and 97835 transitions. [2019-09-10 03:46:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 03:46:45,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:45,303 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:45,303 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 740618575, now seen corresponding path program 1 times [2019-09-10 03:46:45,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:45,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:45,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:45,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-10 03:46:45,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:45,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:45,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2019-09-10 03:46:45,696 INFO L207 CegarAbsIntRunner]: [91], [94], [105], [107], [109], [111], [115], [147], [149], [152], [163], [165], [171], [172], [177], [191], [201], [203], [205], [206], [211], [217], [223], [229], [235], [241], [247], [253], [259], [265], [271], [277], [283], [285], [286], [296], [298], [300], [301], [381], [391], [393], [395], [396], [398], [399], [401], [406], [409], [414], [417], [422], [425], [430], [433], [438], [441], [446], [449], [452], [454], [456], [457], [460], [494], [495], [496], [506], [508], [510], [511], [516], [522], [528], [534], [540], [546], [552], [558], [564], [570], [576], [582], [588], [590], [593], [599], [605], [611], [617], [623], [629], [633], [634], [637], [640], [644], [646], [648], [649], [694], [695], [696], [706], [708], [710], [711], [712], [721], [724], [727], [733], [739], [755], [768], [781], [794], [798], [801], [804], [811], [814], [826], [836], [838], [840], [841], [842], [843], [857], [859], [892], [893], [900], [901], [904], [906], [907], [908], [912], [913], [914], [915], [916], [917], [918], [919], [920], [921], [922], [923], [924], [925], [926], [927], [930], [931], [942], [943], [944], [945], [946], [947], [948], [949], [950], [951], [952], [953], [954], [955], [956], [976], [977], [978] [2019-09-10 03:46:45,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:45,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:46,027 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:46,029 INFO L272 AbstractInterpreter]: Visited 142 different actions 142 times. Never merged. Never widened. Performed 752 root evaluator evaluations with a maximum evaluation depth of 4. Performed 752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 82 variables. [2019-09-10 03:46:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:46,033 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:46,419 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 64.93% of their original sizes. [2019-09-10 03:46:46,419 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:48,605 INFO L420 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2019-09-10 03:46:48,606 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:48,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [5] total 67 [2019-09-10 03:46:48,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:48,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 03:46:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 03:46:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=3272, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 03:46:48,610 INFO L87 Difference]: Start difference. First operand 81072 states and 97835 transitions. Second operand 64 states. [2019-09-10 03:47:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:15,963 INFO L93 Difference]: Finished difference Result 81301 states and 98199 transitions. [2019-09-10 03:47:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 03:47:15,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 256 [2019-09-10 03:47:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:16,223 INFO L225 Difference]: With dead ends: 81301 [2019-09-10 03:47:16,223 INFO L226 Difference]: Without dead ends: 81301 [2019-09-10 03:47:16,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2201, Invalid=9355, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 03:47:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81301 states. [2019-09-10 03:47:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81301 to 81281. [2019-09-10 03:47:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81281 states. [2019-09-10 03:47:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81281 states to 81281 states and 98178 transitions. [2019-09-10 03:47:17,933 INFO L78 Accepts]: Start accepts. Automaton has 81281 states and 98178 transitions. Word has length 256 [2019-09-10 03:47:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:17,933 INFO L475 AbstractCegarLoop]: Abstraction has 81281 states and 98178 transitions. [2019-09-10 03:47:17,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 03:47:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81281 states and 98178 transitions. [2019-09-10 03:47:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 03:47:17,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:17,970 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,971 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -939285231, now seen corresponding path program 1 times [2019-09-10 03:47:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:17,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:17,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:47:18,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:18,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:47:18,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:18,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:47:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:47:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:18,058 INFO L87 Difference]: Start difference. First operand 81281 states and 98178 transitions. Second operand 3 states. [2019-09-10 03:47:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:18,547 INFO L93 Difference]: Finished difference Result 118577 states and 147420 transitions. [2019-09-10 03:47:18,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:47:18,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 03:47:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:18,796 INFO L225 Difference]: With dead ends: 118577 [2019-09-10 03:47:18,796 INFO L226 Difference]: Without dead ends: 118577 [2019-09-10 03:47:18,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118577 states. [2019-09-10 03:47:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118577 to 118574. [2019-09-10 03:47:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118574 states. [2019-09-10 03:47:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118574 states to 118574 states and 147418 transitions. [2019-09-10 03:47:24,481 INFO L78 Accepts]: Start accepts. Automaton has 118574 states and 147418 transitions. Word has length 260 [2019-09-10 03:47:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:24,481 INFO L475 AbstractCegarLoop]: Abstraction has 118574 states and 147418 transitions. [2019-09-10 03:47:24,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:47:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 118574 states and 147418 transitions. [2019-09-10 03:47:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 03:47:24,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:24,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:24,524 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1825332260, now seen corresponding path program 1 times [2019-09-10 03:47:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:24,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:47:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:47:24,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:24,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:47:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:47:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:24,607 INFO L87 Difference]: Start difference. First operand 118574 states and 147418 transitions. Second operand 3 states. [2019-09-10 03:47:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:25,474 INFO L93 Difference]: Finished difference Result 172737 states and 224970 transitions. [2019-09-10 03:47:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:47:25,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-10 03:47:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:25,888 INFO L225 Difference]: With dead ends: 172737 [2019-09-10 03:47:25,888 INFO L226 Difference]: Without dead ends: 172737 [2019-09-10 03:47:25,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172737 states. [2019-09-10 03:47:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172737 to 172734. [2019-09-10 03:47:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172734 states. [2019-09-10 03:47:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172734 states to 172734 states and 224968 transitions. [2019-09-10 03:47:31,223 INFO L78 Accepts]: Start accepts. Automaton has 172734 states and 224968 transitions. Word has length 261 [2019-09-10 03:47:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:31,224 INFO L475 AbstractCegarLoop]: Abstraction has 172734 states and 224968 transitions. [2019-09-10 03:47:31,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:47:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 172734 states and 224968 transitions. [2019-09-10 03:47:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 03:47:31,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:31,310 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,310 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash -392687536, now seen corresponding path program 1 times [2019-09-10 03:47:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:31,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:31,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:47:31,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:47:31,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:31,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:47:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:47:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:31,388 INFO L87 Difference]: Start difference. First operand 172734 states and 224968 transitions. Second operand 3 states. [2019-09-10 03:47:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:38,486 INFO L93 Difference]: Finished difference Result 341123 states and 498991 transitions. [2019-09-10 03:47:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:47:38,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 03:47:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:39,388 INFO L225 Difference]: With dead ends: 341123 [2019-09-10 03:47:39,389 INFO L226 Difference]: Without dead ends: 341123 [2019-09-10 03:47:39,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:47:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341123 states. [2019-09-10 03:47:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341123 to 341060. [2019-09-10 03:47:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341060 states. [2019-09-10 03:48:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341060 states to 341060 states and 498914 transitions. [2019-09-10 03:48:05,457 INFO L78 Accepts]: Start accepts. Automaton has 341060 states and 498914 transitions. Word has length 262 [2019-09-10 03:48:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:05,457 INFO L475 AbstractCegarLoop]: Abstraction has 341060 states and 498914 transitions. [2019-09-10 03:48:05,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:48:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 341060 states and 498914 transitions. [2019-09-10 03:48:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 03:48:05,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:05,563 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:48:05,563 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:05,564 INFO L82 PathProgramCache]: Analyzing trace with hash -76322659, now seen corresponding path program 1 times [2019-09-10 03:48:05,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:05,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:05,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:05,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:48:05,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:05,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:48:05,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:05,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:48:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:48:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:48:05,643 INFO L87 Difference]: Start difference. First operand 341060 states and 498914 transitions. Second operand 3 states. [2019-09-10 03:48:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:18,228 INFO L93 Difference]: Finished difference Result 523779 states and 903554 transitions. [2019-09-10 03:48:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:48:18,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-10 03:48:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:20,748 INFO L225 Difference]: With dead ends: 523779 [2019-09-10 03:48:20,748 INFO L226 Difference]: Without dead ends: 523779 [2019-09-10 03:48:20,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:48:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523779 states. [2019-09-10 03:49:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523779 to 516990. [2019-09-10 03:49:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516990 states. [2019-09-10 03:49:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516990 states to 516990 states and 895563 transitions. [2019-09-10 03:49:35,019 INFO L78 Accepts]: Start accepts. Automaton has 516990 states and 895563 transitions. Word has length 263 [2019-09-10 03:49:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:35,019 INFO L475 AbstractCegarLoop]: Abstraction has 516990 states and 895563 transitions. [2019-09-10 03:49:35,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:49:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 516990 states and 895563 transitions. [2019-09-10 03:49:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 03:49:36,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:36,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:49:36,875 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash 134256527, now seen corresponding path program 1 times [2019-09-10 03:49:36,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:36,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:36,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-10 03:49:36,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:49:36,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:49:36,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-09-10 03:49:36,982 INFO L207 CegarAbsIntRunner]: [91], [94], [105], [107], [109], [111], [115], [147], [149], [152], [163], [165], [171], [172], [177], [191], [201], [203], [205], [206], [211], [217], [223], [229], [235], [241], [247], [253], [259], [265], [271], [277], [283], [285], [286], [296], [298], [300], [301], [381], [391], [393], [395], [396], [398], [399], [401], [406], [409], [414], [417], [422], [425], [430], [433], [438], [441], [446], [449], [452], [454], [456], [457], [460], [494], [495], [496], [506], [508], [510], [511], [516], [522], [528], [534], [540], [546], [552], [558], [564], [570], [576], [582], [588], [590], [593], [599], [605], [611], [617], [623], [629], [633], [634], [637], [640], [644], [646], [648], [649], [694], [695], [696], [706], [708], [710], [711], [712], [721], [724], [727], [733], [739], [746], [752], [759], [765], [772], [778], [785], [791], [798], [801], [804], [811], [814], [826], [836], [838], [840], [841], [842], [843], [857], [859], [892], [893], [900], [901], [904], [906], [907], [908], [912], [913], [914], [915], [916], [917], [918], [919], [920], [921], [922], [923], [924], [925], [926], [927], [930], [931], [942], [943], [944], [945], [946], [947], [948], [949], [950], [951], [952], [953], [954], [955], [956], [976], [977], [978] [2019-09-10 03:49:36,989 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:49:36,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:49:37,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:49:37,110 INFO L272 AbstractInterpreter]: Visited 163 different actions 188 times. Merged at 18 different actions 18 times. Never widened. Performed 1268 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 84 variables. [2019-09-10 03:49:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:37,110 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:49:37,340 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 68.53% of their original sizes. [2019-09-10 03:49:37,341 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:49:42,445 INFO L420 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2019-09-10 03:49:42,445 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:49:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:49:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [87] imperfect sequences [5] total 90 [2019-09-10 03:49:42,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:42,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 03:49:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 03:49:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=6041, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 03:49:42,450 INFO L87 Difference]: Start difference. First operand 516990 states and 895563 transitions. Second operand 87 states. [2019-09-10 03:50:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:33,926 INFO L93 Difference]: Finished difference Result 676612 states and 1200033 transitions. [2019-09-10 03:50:33,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 03:50:33,926 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 264 [2019-09-10 03:50:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:37,520 INFO L225 Difference]: With dead ends: 676612 [2019-09-10 03:50:37,520 INFO L226 Difference]: Without dead ends: 676612 [2019-09-10 03:50:37,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9144 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=5059, Invalid=22997, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 03:50:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676612 states. [2019-09-10 03:52:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676612 to 670083. [2019-09-10 03:52:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670083 states. [2019-09-10 03:52:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670083 states to 670083 states and 1188939 transitions. [2019-09-10 03:52:51,887 INFO L78 Accepts]: Start accepts. Automaton has 670083 states and 1188939 transitions. Word has length 264 [2019-09-10 03:52:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:51,887 INFO L475 AbstractCegarLoop]: Abstraction has 670083 states and 1188939 transitions. [2019-09-10 03:52:51,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 03:52:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 670083 states and 1188939 transitions. [2019-09-10 03:52:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 03:52:52,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:52,139 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,140 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1948765662, now seen corresponding path program 1 times [2019-09-10 03:52:52,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:52,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:52,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:52,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:52,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 03:53:03,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:53:03,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:53:03,382 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2019-09-10 03:53:03,383 INFO L207 CegarAbsIntRunner]: [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [147], [149], [152], [163], [165], [171], [172], [177], [191], [201], [203], [205], [206], [211], [217], [223], [229], [235], [241], [247], [253], [259], [265], [271], [277], [283], [285], [286], [296], [298], [300], [301], [381], [391], [393], [395], [396], [398], [399], [401], [406], [409], [414], [417], [422], [425], [430], [433], [438], [441], [446], [449], [452], [454], [456], [457], [460], [494], [495], [496], [506], [508], [510], [511], [516], [522], [528], [534], [540], [546], [552], [558], [564], [570], [576], [582], [588], [590], [593], [599], [605], [611], [617], [623], [629], [633], [634], [637], [640], [644], [646], [648], [649], [694], [695], [696], [706], [708], [710], [711], [712], [721], [724], [727], [733], [739], [746], [752], [759], [765], [772], [775], [781], [785], [791], [798], [801], [804], [811], [814], [826], [836], [838], [840], [841], [842], [843], [857], [859], [892], [893], [900], [901], [904], [906], [907], [908], [912], [913], [914], [915], [916], [917], [918], [919], [920], [921], [922], [923], [924], [925], [926], [927], [930], [931], [938], [939], [942], [943], [944], [945], [946], [947], [948], [949], [950], [951], [952], [953], [954], [955], [956], [976], [977], [978] [2019-09-10 03:53:03,391 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:53:03,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:53:03,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:53:03,532 INFO L272 AbstractInterpreter]: Visited 173 different actions 213 times. Merged at 21 different actions 21 times. Never widened. Performed 1398 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1398 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 84 variables. [2019-09-10 03:53:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:03,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:53:03,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:53:03,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:53:03,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:03,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:53:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:03,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:53:03,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:53:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:53:03,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:53:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:53:04,182 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:53:04,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 7 [2019-09-10 03:53:04,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:04,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:53:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:53:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:53:04,184 INFO L87 Difference]: Start difference. First operand 670083 states and 1188939 transitions. Second operand 3 states.