java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:01,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:01,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:01,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:01,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:01,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:01,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:01,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:01,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:01,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:01,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:01,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:01,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:01,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:01,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:01,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:01,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:01,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:01,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:01,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:01,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:01,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:01,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:01,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:01,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:01,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:01,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:01,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:01,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:01,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:01,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:01,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:01,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:01,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:01,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:01,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:01,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:01,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:01,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:01,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:01,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:01,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:29:01,598 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:01,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:01,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:01,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:01,601 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:01,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:01,601 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:01,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:01,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:01,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:01,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:01,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:01,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:01,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:01,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:01,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:01,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:01,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:01,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:01,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:01,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:01,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:01,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:01,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:01,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:01,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:01,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:01,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:01,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:29:01,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:01,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:01,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:01,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:01,891 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:01,891 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-10-15 01:29:01,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4147ff7e/54cbb94dd7ad4c799febc30999fe3cc7/FLAG6836201ae [2019-10-15 01:29:02,438 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:02,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-10-15 01:29:02,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4147ff7e/54cbb94dd7ad4c799febc30999fe3cc7/FLAG6836201ae [2019-10-15 01:29:02,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4147ff7e/54cbb94dd7ad4c799febc30999fe3cc7 [2019-10-15 01:29:02,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:02,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:02,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:02,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:02,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:02,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:02" (1/1) ... [2019-10-15 01:29:02,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5370fc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:02, skipping insertion in model container [2019-10-15 01:29:02,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:02" (1/1) ... [2019-10-15 01:29:02,850 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:02,900 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:03,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:03,161 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:03,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:03,350 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:03,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03 WrapperNode [2019-10-15 01:29:03,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:03,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:03,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:03,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:03,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... [2019-10-15 01:29:03,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:03,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:03,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:03,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:03,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:29:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:29:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:29:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-15 01:29:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-15 01:29:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-15 01:29:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:29:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:29:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:29:03,469 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:29:03,469 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-15 01:29:03,469 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-15 01:29:03,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:29:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:29:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:29:03,474 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:29:03,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:29:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:29:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:29:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:29:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:29:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-15 01:29:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:29:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:29:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:29:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:29:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:29:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:29:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:04,324 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:04,324 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:29:04,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:04 BoogieIcfgContainer [2019-10-15 01:29:04,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:04,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:04,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:04,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:04,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:02" (1/3) ... [2019-10-15 01:29:04,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d066e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:04, skipping insertion in model container [2019-10-15 01:29:04,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:03" (2/3) ... [2019-10-15 01:29:04,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d066e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:04, skipping insertion in model container [2019-10-15 01:29:04,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:04" (3/3) ... [2019-10-15 01:29:04,339 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-10-15 01:29:04,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:04,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:04,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:04,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:04,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:04,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:04,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:04,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:04,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:04,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:04,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states. [2019-10-15 01:29:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:04,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:04,458 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1616556766, now seen corresponding path program 1 times [2019-10-15 01:29:04,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69511960] [2019-10-15 01:29:04,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:04,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69511960] [2019-10-15 01:29:04,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:04,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:04,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662723536] [2019-10-15 01:29:04,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:04,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:04,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:04,960 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 4 states. [2019-10-15 01:29:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,293 INFO L93 Difference]: Finished difference Result 556 states and 834 transitions. [2019-10-15 01:29:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:05,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:29:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,324 INFO L225 Difference]: With dead ends: 556 [2019-10-15 01:29:05,325 INFO L226 Difference]: Without dead ends: 280 [2019-10-15 01:29:05,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-15 01:29:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-10-15 01:29:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 396 transitions. [2019-10-15 01:29:05,483 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 396 transitions. Word has length 150 [2019-10-15 01:29:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,487 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 396 transitions. [2019-10-15 01:29:05,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 396 transitions. [2019-10-15 01:29:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:05,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:05,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -668504800, now seen corresponding path program 1 times [2019-10-15 01:29:05,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:05,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673753127] [2019-10-15 01:29:05,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:05,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673753127] [2019-10-15 01:29:05,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:05,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:05,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760714580] [2019-10-15 01:29:05,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:05,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:05,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:05,767 INFO L87 Difference]: Start difference. First operand 280 states and 396 transitions. Second operand 5 states. [2019-10-15 01:29:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,459 INFO L93 Difference]: Finished difference Result 580 states and 842 transitions. [2019-10-15 01:29:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:06,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,463 INFO L225 Difference]: With dead ends: 580 [2019-10-15 01:29:06,463 INFO L226 Difference]: Without dead ends: 324 [2019-10-15 01:29:06,465 INFO L600 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-10-15 01:29:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-15 01:29:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-15 01:29:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2019-10-15 01:29:06,494 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 150 [2019-10-15 01:29:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,495 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2019-10-15 01:29:06,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2019-10-15 01:29:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:06,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:06,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash 278533086, now seen corresponding path program 1 times [2019-10-15 01:29:06,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475534619] [2019-10-15 01:29:06,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:06,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475534619] [2019-10-15 01:29:06,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:06,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:06,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528910790] [2019-10-15 01:29:06,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:06,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:06,644 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand 5 states. [2019-10-15 01:29:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,243 INFO L93 Difference]: Finished difference Result 580 states and 841 transitions. [2019-10-15 01:29:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:07,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,247 INFO L225 Difference]: With dead ends: 580 [2019-10-15 01:29:07,247 INFO L226 Difference]: Without dead ends: 324 [2019-10-15 01:29:07,249 INFO L600 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-10-15 01:29:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-15 01:29:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-15 01:29:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 394 transitions. [2019-10-15 01:29:07,273 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 394 transitions. Word has length 150 [2019-10-15 01:29:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 394 transitions. [2019-10-15 01:29:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 394 transitions. [2019-10-15 01:29:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:07,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:07,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:07,277 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1140366688, now seen corresponding path program 1 times [2019-10-15 01:29:07,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:07,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077165557] [2019-10-15 01:29:07,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:07,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077165557] [2019-10-15 01:29:07,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:07,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:07,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771615084] [2019-10-15 01:29:07,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:07,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:07,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:07,398 INFO L87 Difference]: Start difference. First operand 280 states and 394 transitions. Second operand 5 states. [2019-10-15 01:29:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,934 INFO L93 Difference]: Finished difference Result 578 states and 835 transitions. [2019-10-15 01:29:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:07,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,938 INFO L225 Difference]: With dead ends: 578 [2019-10-15 01:29:07,938 INFO L226 Difference]: Without dead ends: 322 [2019-10-15 01:29:07,940 INFO L600 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-10-15 01:29:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-15 01:29:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2019-10-15 01:29:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2019-10-15 01:29:07,963 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 150 [2019-10-15 01:29:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:07,964 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2019-10-15 01:29:07,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2019-10-15 01:29:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:07,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:07,966 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:07,967 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash -910042210, now seen corresponding path program 1 times [2019-10-15 01:29:07,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:07,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538801694] [2019-10-15 01:29:07,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:08,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538801694] [2019-10-15 01:29:08,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:08,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:08,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241350204] [2019-10-15 01:29:08,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:08,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:08,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:08,076 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand 5 states. [2019-10-15 01:29:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:08,581 INFO L93 Difference]: Finished difference Result 576 states and 829 transitions. [2019-10-15 01:29:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:08,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:08,585 INFO L225 Difference]: With dead ends: 576 [2019-10-15 01:29:08,585 INFO L226 Difference]: Without dead ends: 320 [2019-10-15 01:29:08,586 INFO L600 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-10-15 01:29:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-15 01:29:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 280. [2019-10-15 01:29:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2019-10-15 01:29:08,608 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 150 [2019-10-15 01:29:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,608 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2019-10-15 01:29:08,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2019-10-15 01:29:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:08,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:08,611 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -421995104, now seen corresponding path program 1 times [2019-10-15 01:29:08,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773689153] [2019-10-15 01:29:08,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:08,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773689153] [2019-10-15 01:29:08,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:08,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:08,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682446080] [2019-10-15 01:29:08,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:08,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:08,690 INFO L87 Difference]: Start difference. First operand 280 states and 392 transitions. Second operand 5 states. [2019-10-15 01:29:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:09,283 INFO L93 Difference]: Finished difference Result 574 states and 823 transitions. [2019-10-15 01:29:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:09,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:09,286 INFO L225 Difference]: With dead ends: 574 [2019-10-15 01:29:09,287 INFO L226 Difference]: Without dead ends: 318 [2019-10-15 01:29:09,288 INFO L600 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-10-15 01:29:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-15 01:29:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-10-15 01:29:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 391 transitions. [2019-10-15 01:29:09,316 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 391 transitions. Word has length 150 [2019-10-15 01:29:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:09,316 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 391 transitions. [2019-10-15 01:29:09,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2019-10-15 01:29:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:09,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:09,319 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:09,320 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1514630306, now seen corresponding path program 1 times [2019-10-15 01:29:09,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:09,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080208583] [2019-10-15 01:29:09,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:09,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080208583] [2019-10-15 01:29:09,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:09,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:09,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845276514] [2019-10-15 01:29:09,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:09,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:09,404 INFO L87 Difference]: Start difference. First operand 280 states and 391 transitions. Second operand 5 states. [2019-10-15 01:29:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:09,935 INFO L93 Difference]: Finished difference Result 570 states and 813 transitions. [2019-10-15 01:29:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:09,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:09,939 INFO L225 Difference]: With dead ends: 570 [2019-10-15 01:29:09,939 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 01:29:09,940 INFO L600 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-10-15 01:29:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 01:29:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-10-15 01:29:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 390 transitions. [2019-10-15 01:29:09,968 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 390 transitions. Word has length 150 [2019-10-15 01:29:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:09,968 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 390 transitions. [2019-10-15 01:29:09,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 390 transitions. [2019-10-15 01:29:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:09,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:09,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:09,973 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash 937861276, now seen corresponding path program 1 times [2019-10-15 01:29:09,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:09,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939248392] [2019-10-15 01:29:09,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:10,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939248392] [2019-10-15 01:29:10,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:10,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:10,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290858260] [2019-10-15 01:29:10,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:10,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:10,064 INFO L87 Difference]: Start difference. First operand 280 states and 390 transitions. Second operand 5 states. [2019-10-15 01:29:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,586 INFO L93 Difference]: Finished difference Result 599 states and 863 transitions. [2019-10-15 01:29:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:10,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,589 INFO L225 Difference]: With dead ends: 599 [2019-10-15 01:29:10,589 INFO L226 Difference]: Without dead ends: 343 [2019-10-15 01:29:10,590 INFO L600 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-10-15 01:29:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-15 01:29:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2019-10-15 01:29:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 389 transitions. [2019-10-15 01:29:10,613 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 389 transitions. Word has length 150 [2019-10-15 01:29:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:10,614 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 389 transitions. [2019-10-15 01:29:10,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 389 transitions. [2019-10-15 01:29:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:10,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:10,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:10,616 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -784141410, now seen corresponding path program 1 times [2019-10-15 01:29:10,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:10,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679184248] [2019-10-15 01:29:10,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:10,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:10,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:10,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679184248] [2019-10-15 01:29:10,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:10,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:10,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757702446] [2019-10-15 01:29:10,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:10,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:10,707 INFO L87 Difference]: Start difference. First operand 280 states and 389 transitions. Second operand 5 states. [2019-10-15 01:29:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:11,272 INFO L93 Difference]: Finished difference Result 597 states and 857 transitions. [2019-10-15 01:29:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:11,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:11,275 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:29:11,275 INFO L226 Difference]: Without dead ends: 341 [2019-10-15 01:29:11,277 INFO L600 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-10-15 01:29:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-10-15 01:29:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 280. [2019-10-15 01:29:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 388 transitions. [2019-10-15 01:29:11,300 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 388 transitions. Word has length 150 [2019-10-15 01:29:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:11,301 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 388 transitions. [2019-10-15 01:29:11,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 388 transitions. [2019-10-15 01:29:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:11,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:11,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:11,304 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:11,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:11,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1116784548, now seen corresponding path program 1 times [2019-10-15 01:29:11,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:11,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795813145] [2019-10-15 01:29:11,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:11,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795813145] [2019-10-15 01:29:11,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:11,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:11,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741216436] [2019-10-15 01:29:11,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:11,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:11,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:11,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:11,388 INFO L87 Difference]: Start difference. First operand 280 states and 388 transitions. Second operand 5 states. [2019-10-15 01:29:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:11,962 INFO L93 Difference]: Finished difference Result 595 states and 851 transitions. [2019-10-15 01:29:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:11,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:11,965 INFO L225 Difference]: With dead ends: 595 [2019-10-15 01:29:11,965 INFO L226 Difference]: Without dead ends: 339 [2019-10-15 01:29:11,966 INFO L600 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-10-15 01:29:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-15 01:29:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 280. [2019-10-15 01:29:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 387 transitions. [2019-10-15 01:29:11,992 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 387 transitions. Word has length 150 [2019-10-15 01:29:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:11,993 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 387 transitions. [2019-10-15 01:29:11,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 387 transitions. [2019-10-15 01:29:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:11,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:11,996 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:11,996 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash 812147678, now seen corresponding path program 1 times [2019-10-15 01:29:11,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:11,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694239843] [2019-10-15 01:29:11,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:12,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694239843] [2019-10-15 01:29:12,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:12,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:12,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364864135] [2019-10-15 01:29:12,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:12,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:12,076 INFO L87 Difference]: Start difference. First operand 280 states and 387 transitions. Second operand 5 states. [2019-10-15 01:29:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:12,569 INFO L93 Difference]: Finished difference Result 593 states and 845 transitions. [2019-10-15 01:29:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:12,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:12,572 INFO L225 Difference]: With dead ends: 593 [2019-10-15 01:29:12,572 INFO L226 Difference]: Without dead ends: 337 [2019-10-15 01:29:12,573 INFO L600 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-10-15 01:29:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-15 01:29:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2019-10-15 01:29:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 386 transitions. [2019-10-15 01:29:12,600 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 386 transitions. Word has length 150 [2019-10-15 01:29:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:12,600 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 386 transitions. [2019-10-15 01:29:12,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 386 transitions. [2019-10-15 01:29:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:12,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:12,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:12,603 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1480933348, now seen corresponding path program 1 times [2019-10-15 01:29:12,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:12,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860466112] [2019-10-15 01:29:12,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:12,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860466112] [2019-10-15 01:29:12,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:12,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:12,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838044181] [2019-10-15 01:29:12,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:12,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:12,732 INFO L87 Difference]: Start difference. First operand 280 states and 386 transitions. Second operand 5 states. [2019-10-15 01:29:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:13,307 INFO L93 Difference]: Finished difference Result 591 states and 839 transitions. [2019-10-15 01:29:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:13,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:13,311 INFO L225 Difference]: With dead ends: 591 [2019-10-15 01:29:13,311 INFO L226 Difference]: Without dead ends: 335 [2019-10-15 01:29:13,312 INFO L600 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-10-15 01:29:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-15 01:29:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 280. [2019-10-15 01:29:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2019-10-15 01:29:13,338 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 150 [2019-10-15 01:29:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:13,338 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2019-10-15 01:29:13,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2019-10-15 01:29:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:13,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:13,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:13,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 246211614, now seen corresponding path program 1 times [2019-10-15 01:29:13,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:13,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710505414] [2019-10-15 01:29:13,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:13,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710505414] [2019-10-15 01:29:13,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:13,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:13,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552931963] [2019-10-15 01:29:13,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:13,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:13,428 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand 5 states. [2019-10-15 01:29:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:13,980 INFO L93 Difference]: Finished difference Result 589 states and 833 transitions. [2019-10-15 01:29:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:13,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:13,984 INFO L225 Difference]: With dead ends: 589 [2019-10-15 01:29:13,984 INFO L226 Difference]: Without dead ends: 333 [2019-10-15 01:29:13,986 INFO L600 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-10-15 01:29:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-15 01:29:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2019-10-15 01:29:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:29:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2019-10-15 01:29:14,036 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 150 [2019-10-15 01:29:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:14,038 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2019-10-15 01:29:14,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2019-10-15 01:29:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:14,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:14,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:14,044 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash 717567964, now seen corresponding path program 1 times [2019-10-15 01:29:14,046 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:14,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171681004] [2019-10-15 01:29:14,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:14,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171681004] [2019-10-15 01:29:14,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:14,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:14,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572696363] [2019-10-15 01:29:14,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:14,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:14,242 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand 4 states. [2019-10-15 01:29:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:14,614 INFO L93 Difference]: Finished difference Result 782 states and 1109 transitions. [2019-10-15 01:29:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:14,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:29:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:14,618 INFO L225 Difference]: With dead ends: 782 [2019-10-15 01:29:14,619 INFO L226 Difference]: Without dead ends: 527 [2019-10-15 01:29:14,620 INFO L600 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-10-15 01:29:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-15 01:29:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2019-10-15 01:29:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-10-15 01:29:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 716 transitions. [2019-10-15 01:29:14,678 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 716 transitions. Word has length 150 [2019-10-15 01:29:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:14,678 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 716 transitions. [2019-10-15 01:29:14,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 716 transitions. [2019-10-15 01:29:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:14,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:14,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:14,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1005027869, now seen corresponding path program 1 times [2019-10-15 01:29:14,681 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:14,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016280042] [2019-10-15 01:29:14,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:14,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016280042] [2019-10-15 01:29:14,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:14,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:14,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783823004] [2019-10-15 01:29:14,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:14,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:14,742 INFO L87 Difference]: Start difference. First operand 522 states and 716 transitions. Second operand 6 states. [2019-10-15 01:29:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:14,824 INFO L93 Difference]: Finished difference Result 1044 states and 1470 transitions. [2019-10-15 01:29:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:14,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:14,828 INFO L225 Difference]: With dead ends: 1044 [2019-10-15 01:29:14,828 INFO L226 Difference]: Without dead ends: 547 [2019-10-15 01:29:14,830 INFO L600 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-10-15 01:29:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-15 01:29:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2019-10-15 01:29:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-15 01:29:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 720 transitions. [2019-10-15 01:29:14,888 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 720 transitions. Word has length 150 [2019-10-15 01:29:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:14,888 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 720 transitions. [2019-10-15 01:29:14,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 720 transitions. [2019-10-15 01:29:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:14,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:14,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:14,890 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:14,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2036068767, now seen corresponding path program 1 times [2019-10-15 01:29:14,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:14,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616698223] [2019-10-15 01:29:14,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:14,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616698223] [2019-10-15 01:29:14,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:14,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:14,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087797283] [2019-10-15 01:29:14,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:14,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:14,953 INFO L87 Difference]: Start difference. First operand 527 states and 720 transitions. Second operand 4 states. [2019-10-15 01:29:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:15,343 INFO L93 Difference]: Finished difference Result 1518 states and 2144 transitions. [2019-10-15 01:29:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:15,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:29:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:15,349 INFO L225 Difference]: With dead ends: 1518 [2019-10-15 01:29:15,349 INFO L226 Difference]: Without dead ends: 1016 [2019-10-15 01:29:15,352 INFO L600 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-10-15 01:29:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-15 01:29:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1009. [2019-10-15 01:29:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-15 01:29:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1377 transitions. [2019-10-15 01:29:15,452 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1377 transitions. Word has length 150 [2019-10-15 01:29:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:15,453 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1377 transitions. [2019-10-15 01:29:15,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1377 transitions. [2019-10-15 01:29:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:15,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:15,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:15,455 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1903302082, now seen corresponding path program 1 times [2019-10-15 01:29:15,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:15,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359979286] [2019-10-15 01:29:15,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:15,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:15,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:15,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359979286] [2019-10-15 01:29:15,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:15,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:15,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741373124] [2019-10-15 01:29:15,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:15,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:15,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:15,531 INFO L87 Difference]: Start difference. First operand 1009 states and 1377 transitions. Second operand 6 states. [2019-10-15 01:29:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:15,709 INFO L93 Difference]: Finished difference Result 2037 states and 2852 transitions. [2019-10-15 01:29:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:15,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:15,719 INFO L225 Difference]: With dead ends: 2037 [2019-10-15 01:29:15,720 INFO L226 Difference]: Without dead ends: 1053 [2019-10-15 01:29:15,726 INFO L600 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-10-15 01:29:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-15 01:29:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1019. [2019-10-15 01:29:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-15 01:29:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1385 transitions. [2019-10-15 01:29:15,850 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1385 transitions. Word has length 150 [2019-10-15 01:29:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:15,850 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1385 transitions. [2019-10-15 01:29:15,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1385 transitions. [2019-10-15 01:29:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:15,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:15,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:15,853 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -26238852, now seen corresponding path program 1 times [2019-10-15 01:29:15,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:15,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884563279] [2019-10-15 01:29:15,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:15,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:15,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:15,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884563279] [2019-10-15 01:29:15,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:15,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:15,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050205476] [2019-10-15 01:29:15,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:15,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:15,934 INFO L87 Difference]: Start difference. First operand 1019 states and 1385 transitions. Second operand 4 states. [2019-10-15 01:29:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:16,417 INFO L93 Difference]: Finished difference Result 2982 states and 4193 transitions. [2019-10-15 01:29:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:16,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:29:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:16,432 INFO L225 Difference]: With dead ends: 2982 [2019-10-15 01:29:16,432 INFO L226 Difference]: Without dead ends: 1988 [2019-10-15 01:29:16,440 INFO L600 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-10-15 01:29:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-10-15 01:29:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1977. [2019-10-15 01:29:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-15 01:29:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2685 transitions. [2019-10-15 01:29:16,701 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2685 transitions. Word has length 150 [2019-10-15 01:29:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:16,701 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2685 transitions. [2019-10-15 01:29:16,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2685 transitions. [2019-10-15 01:29:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:16,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:16,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:16,706 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1511479043, now seen corresponding path program 1 times [2019-10-15 01:29:16,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:16,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319574519] [2019-10-15 01:29:16,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:16,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-10-15 01:29:16,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319574519] [2019-10-15 01:29:16,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:16,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:16,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306525770] [2019-10-15 01:29:16,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:16,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:16,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:16,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:16,797 INFO L87 Difference]: Start difference. First operand 1977 states and 2685 transitions. Second operand 6 states. [2019-10-15 01:29:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:17,039 INFO L93 Difference]: Finished difference Result 4005 states and 5580 transitions. [2019-10-15 01:29:17,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:17,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:17,052 INFO L225 Difference]: With dead ends: 4005 [2019-10-15 01:29:17,052 INFO L226 Difference]: Without dead ends: 2053 [2019-10-15 01:29:17,060 INFO L600 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-10-15 01:29:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-10-15 01:29:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1997. [2019-10-15 01:29:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-10-15 01:29:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2701 transitions. [2019-10-15 01:29:17,280 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2701 transitions. Word has length 150 [2019-10-15 01:29:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:17,281 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2701 transitions. [2019-10-15 01:29:17,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2701 transitions. [2019-10-15 01:29:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:17,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:17,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:17,283 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1725650175, now seen corresponding path program 1 times [2019-10-15 01:29:17,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:17,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129848077] [2019-10-15 01:29:17,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:17,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129848077] [2019-10-15 01:29:17,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:17,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:17,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262492115] [2019-10-15 01:29:17,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:17,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:17,350 INFO L87 Difference]: Start difference. First operand 1997 states and 2701 transitions. Second operand 6 states. [2019-10-15 01:29:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:17,556 INFO L93 Difference]: Finished difference Result 4097 states and 5693 transitions. [2019-10-15 01:29:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:17,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:17,571 INFO L225 Difference]: With dead ends: 4097 [2019-10-15 01:29:17,571 INFO L226 Difference]: Without dead ends: 2125 [2019-10-15 01:29:17,583 INFO L600 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-10-15 01:29:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-10-15 01:29:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2037. [2019-10-15 01:29:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-10-15 01:29:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2741 transitions. [2019-10-15 01:29:17,844 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2741 transitions. Word has length 150 [2019-10-15 01:29:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:17,845 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 2741 transitions. [2019-10-15 01:29:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2741 transitions. [2019-10-15 01:29:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:17,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:17,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:17,849 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1802550973, now seen corresponding path program 1 times [2019-10-15 01:29:17,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:17,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992760617] [2019-10-15 01:29:17,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:17,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992760617] [2019-10-15 01:29:17,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:17,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:17,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025482000] [2019-10-15 01:29:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:17,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:17,937 INFO L87 Difference]: Start difference. First operand 2037 states and 2741 transitions. Second operand 4 states. [2019-10-15 01:29:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:18,533 INFO L93 Difference]: Finished difference Result 6012 states and 8379 transitions. [2019-10-15 01:29:18,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:18,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:29:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:18,557 INFO L225 Difference]: With dead ends: 6012 [2019-10-15 01:29:18,558 INFO L226 Difference]: Without dead ends: 4000 [2019-10-15 01:29:18,569 INFO L600 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-10-15 01:29:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2019-10-15 01:29:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3981. [2019-10-15 01:29:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2019-10-15 01:29:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 5359 transitions. [2019-10-15 01:29:18,918 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 5359 transitions. Word has length 150 [2019-10-15 01:29:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 3981 states and 5359 transitions. [2019-10-15 01:29:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 5359 transitions. [2019-10-15 01:29:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:18,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:18,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:18,921 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1354787458, now seen corresponding path program 1 times [2019-10-15 01:29:18,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:18,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300221766] [2019-10-15 01:29:18,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:18,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:18,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:18,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300221766] [2019-10-15 01:29:18,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:18,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:18,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320978460] [2019-10-15 01:29:18,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:18,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:18,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:18,994 INFO L87 Difference]: Start difference. First operand 3981 states and 5359 transitions. Second operand 6 states. [2019-10-15 01:29:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:19,427 INFO L93 Difference]: Finished difference Result 8041 states and 11102 transitions. [2019-10-15 01:29:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:19,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:19,458 INFO L225 Difference]: With dead ends: 8041 [2019-10-15 01:29:19,458 INFO L226 Difference]: Without dead ends: 4085 [2019-10-15 01:29:19,485 INFO L600 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-10-15 01:29:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-10-15 01:29:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4021. [2019-10-15 01:29:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-10-15 01:29:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5391 transitions. [2019-10-15 01:29:19,862 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5391 transitions. Word has length 150 [2019-10-15 01:29:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:19,863 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 5391 transitions. [2019-10-15 01:29:19,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5391 transitions. [2019-10-15 01:29:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:19,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:19,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:19,865 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1772184064, now seen corresponding path program 1 times [2019-10-15 01:29:19,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:19,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935007223] [2019-10-15 01:29:19,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:19,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935007223] [2019-10-15 01:29:19,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:19,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:19,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698586673] [2019-10-15 01:29:19,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:19,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:19,936 INFO L87 Difference]: Start difference. First operand 4021 states and 5391 transitions. Second operand 6 states. [2019-10-15 01:29:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:20,340 INFO L93 Difference]: Finished difference Result 8177 states and 11247 transitions. [2019-10-15 01:29:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:20,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:20,373 INFO L225 Difference]: With dead ends: 8177 [2019-10-15 01:29:20,373 INFO L226 Difference]: Without dead ends: 4181 [2019-10-15 01:29:20,391 INFO L600 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-10-15 01:29:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-10-15 01:29:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4101. [2019-10-15 01:29:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-10-15 01:29:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5471 transitions. [2019-10-15 01:29:20,760 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5471 transitions. Word has length 150 [2019-10-15 01:29:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:20,761 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5471 transitions. [2019-10-15 01:29:20,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5471 transitions. [2019-10-15 01:29:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:20,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:20,763 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:20,763 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -896165058, now seen corresponding path program 1 times [2019-10-15 01:29:20,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:20,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754776822] [2019-10-15 01:29:20,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:20,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:20,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:20,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754776822] [2019-10-15 01:29:20,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:20,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:20,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848209294] [2019-10-15 01:29:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:20,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:20,837 INFO L87 Difference]: Start difference. First operand 4101 states and 5471 transitions. Second operand 6 states. [2019-10-15 01:29:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:21,324 INFO L93 Difference]: Finished difference Result 8289 states and 11327 transitions. [2019-10-15 01:29:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:21,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-15 01:29:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:21,352 INFO L225 Difference]: With dead ends: 8289 [2019-10-15 01:29:21,352 INFO L226 Difference]: Without dead ends: 4213 [2019-10-15 01:29:21,374 INFO L600 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-10-15 01:29:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-10-15 01:29:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4181. [2019-10-15 01:29:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-10-15 01:29:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5551 transitions. [2019-10-15 01:29:21,715 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5551 transitions. Word has length 150 [2019-10-15 01:29:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:21,716 INFO L462 AbstractCegarLoop]: Abstraction has 4181 states and 5551 transitions. [2019-10-15 01:29:21,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5551 transitions. [2019-10-15 01:29:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:21,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:21,718 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:21,718 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2678720, now seen corresponding path program 1 times [2019-10-15 01:29:21,719 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:21,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671365280] [2019-10-15 01:29:21,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:21,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:21,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:21,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-10-15 01:29:21,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671365280] [2019-10-15 01:29:21,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:21,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:21,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523050380] [2019-10-15 01:29:21,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:21,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:21,798 INFO L87 Difference]: Start difference. First operand 4181 states and 5551 transitions. Second operand 5 states. [2019-10-15 01:29:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:23,429 INFO L93 Difference]: Finished difference Result 10280 states and 13864 transitions. [2019-10-15 01:29:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:29:23,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:23,453 INFO L225 Difference]: With dead ends: 10280 [2019-10-15 01:29:23,453 INFO L226 Difference]: Without dead ends: 6125 [2019-10-15 01:29:23,470 INFO L600 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-10-15 01:29:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-10-15 01:29:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5757. [2019-10-15 01:29:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-15 01:29:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7407 transitions. [2019-10-15 01:29:23,908 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7407 transitions. Word has length 150 [2019-10-15 01:29:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:23,908 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7407 transitions. [2019-10-15 01:29:23,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7407 transitions. [2019-10-15 01:29:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:23,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:23,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:23,910 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:23,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 420968002, now seen corresponding path program 1 times [2019-10-15 01:29:23,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:23,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104464899] [2019-10-15 01:29:23,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:23,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:23,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:23,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104464899] [2019-10-15 01:29:23,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:23,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:23,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054452448] [2019-10-15 01:29:23,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:23,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:23,986 INFO L87 Difference]: Start difference. First operand 5757 states and 7407 transitions. Second operand 5 states. [2019-10-15 01:29:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:25,072 INFO L93 Difference]: Finished difference Result 11488 states and 14827 transitions. [2019-10-15 01:29:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:25,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:25,101 INFO L225 Difference]: With dead ends: 11488 [2019-10-15 01:29:25,102 INFO L226 Difference]: Without dead ends: 5757 [2019-10-15 01:29:25,114 INFO L600 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-10-15 01:29:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-15 01:29:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-15 01:29:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-15 01:29:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7367 transitions. [2019-10-15 01:29:25,778 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7367 transitions. Word has length 150 [2019-10-15 01:29:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:25,779 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7367 transitions. [2019-10-15 01:29:25,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7367 transitions. [2019-10-15 01:29:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:25,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:25,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:25,782 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -950839296, now seen corresponding path program 1 times [2019-10-15 01:29:25,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:25,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104419781] [2019-10-15 01:29:25,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:25,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:25,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:25,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104419781] [2019-10-15 01:29:25,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:25,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:25,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638123383] [2019-10-15 01:29:25,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:25,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:25,887 INFO L87 Difference]: Start difference. First operand 5757 states and 7367 transitions. Second operand 5 states. [2019-10-15 01:29:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:26,828 INFO L93 Difference]: Finished difference Result 11488 states and 14747 transitions. [2019-10-15 01:29:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:26,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:26,849 INFO L225 Difference]: With dead ends: 11488 [2019-10-15 01:29:26,850 INFO L226 Difference]: Without dead ends: 5757 [2019-10-15 01:29:26,858 INFO L600 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-10-15 01:29:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-15 01:29:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-15 01:29:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-15 01:29:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7327 transitions. [2019-10-15 01:29:27,297 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7327 transitions. Word has length 150 [2019-10-15 01:29:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:27,297 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7327 transitions. [2019-10-15 01:29:27,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7327 transitions. [2019-10-15 01:29:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:27,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:27,299 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:27,299 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1980198594, now seen corresponding path program 1 times [2019-10-15 01:29:27,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:27,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184448642] [2019-10-15 01:29:27,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:27,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:27,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:27,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184448642] [2019-10-15 01:29:27,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:27,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:27,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462692399] [2019-10-15 01:29:27,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:27,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:27,368 INFO L87 Difference]: Start difference. First operand 5757 states and 7327 transitions. Second operand 5 states. [2019-10-15 01:29:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:28,178 INFO L93 Difference]: Finished difference Result 11488 states and 14667 transitions. [2019-10-15 01:29:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:28,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:28,196 INFO L225 Difference]: With dead ends: 11488 [2019-10-15 01:29:28,197 INFO L226 Difference]: Without dead ends: 5757 [2019-10-15 01:29:28,205 INFO L600 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-10-15 01:29:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-15 01:29:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-15 01:29:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-15 01:29:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7287 transitions. [2019-10-15 01:29:28,681 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7287 transitions. Word has length 150 [2019-10-15 01:29:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:28,682 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7287 transitions. [2019-10-15 01:29:28,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7287 transitions. [2019-10-15 01:29:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:28,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:28,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:28,684 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1320667072, now seen corresponding path program 1 times [2019-10-15 01:29:28,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:28,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284028746] [2019-10-15 01:29:28,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:28,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:28,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:28,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284028746] [2019-10-15 01:29:28,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:28,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:28,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604107327] [2019-10-15 01:29:28,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:28,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:28,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:28,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:28,760 INFO L87 Difference]: Start difference. First operand 5757 states and 7287 transitions. Second operand 5 states. [2019-10-15 01:29:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:29,981 INFO L93 Difference]: Finished difference Result 13698 states and 17482 transitions. [2019-10-15 01:29:29,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:29,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:30,006 INFO L225 Difference]: With dead ends: 13698 [2019-10-15 01:29:30,006 INFO L226 Difference]: Without dead ends: 7967 [2019-10-15 01:29:30,015 INFO L600 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-10-15 01:29:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2019-10-15 01:29:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7671. [2019-10-15 01:29:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-10-15 01:29:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9517 transitions. [2019-10-15 01:29:30,515 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9517 transitions. Word has length 150 [2019-10-15 01:29:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:30,515 INFO L462 AbstractCegarLoop]: Abstraction has 7671 states and 9517 transitions. [2019-10-15 01:29:30,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9517 transitions. [2019-10-15 01:29:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:29:30,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:30,517 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:30,517 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1715033858, now seen corresponding path program 1 times [2019-10-15 01:29:30,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:30,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686097091] [2019-10-15 01:29:30,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:30,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:30,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:30,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686097091] [2019-10-15 01:29:30,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:30,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:30,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807977053] [2019-10-15 01:29:30,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:30,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:30,598 INFO L87 Difference]: Start difference. First operand 7671 states and 9517 transitions. Second operand 5 states. [2019-10-15 01:29:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:32,017 INFO L93 Difference]: Finished difference Result 15314 states and 19075 transitions. [2019-10-15 01:29:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:32,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:29:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:32,046 INFO L225 Difference]: With dead ends: 15314 [2019-10-15 01:29:32,046 INFO L226 Difference]: Without dead ends: 7671 [2019-10-15 01:29:32,063 INFO L600 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-10-15 01:29:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states.