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/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:36,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:36,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:36,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:36,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:36,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:36,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:36,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:36,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:36,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:36,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:36,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:36,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:36,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:36,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:36,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:36,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:36,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:36,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:36,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:36,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:36,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:36,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:36,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:36,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:36,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:36,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:36,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:36,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:36,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:36,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:36,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:36,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:36,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:36,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:36,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:36,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:36,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:36,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:36,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:36,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:36,411 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:28:36,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:36,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:36,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:36,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:36,434 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:36,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:36,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:36,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:36,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:36,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:36,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:36,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:36,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:36,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:36,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:36,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:36,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:36,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:36,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:36,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:36,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:36,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:36,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:36,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:36,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:36,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:36,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:36,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:36,440 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:28:36,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:36,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:36,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:36,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:36,727 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:36,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-10-15 01:28:36,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e88b6/c412be1aafb040c8ba4d3383d40c9e87/FLAG7fa56ef2b [2019-10-15 01:28:37,251 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:37,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-10-15 01:28:37,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e88b6/c412be1aafb040c8ba4d3383d40c9e87/FLAG7fa56ef2b [2019-10-15 01:28:37,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad07e88b6/c412be1aafb040c8ba4d3383d40c9e87 [2019-10-15 01:28:37,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:37,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:37,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:37,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:37,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:37,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a913c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37, skipping insertion in model container [2019-10-15 01:28:37,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:37,644 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:37,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:37,906 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:38,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:38,094 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:38,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38 WrapperNode [2019-10-15 01:28:38,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:38,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:38,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:38,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:38,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (1/1) ... [2019-10-15 01:28:38,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:38,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:38,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:38,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:38,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (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:28:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:38,216 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:38,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:38,219 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:38,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:38,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:38,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:38,220 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:38,220 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-15 01:28:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:38,943 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:38,944 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-15 01:28:38,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:38 BoogieIcfgContainer [2019-10-15 01:28:38,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:38,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:38,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:38,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:38,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:37" (1/3) ... [2019-10-15 01:28:38,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:38, skipping insertion in model container [2019-10-15 01:28:38,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:38" (2/3) ... [2019-10-15 01:28:38,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ed422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:38, skipping insertion in model container [2019-10-15 01:28:38,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:38" (3/3) ... [2019-10-15 01:28:38,954 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2019-10-15 01:28:38,964 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:38,973 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:38,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:39,014 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:39,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:39,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:39,015 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:39,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:39,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:39,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:39,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-10-15 01:28:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:39,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,085 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] [2019-10-15 01:28:39,086 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1526033595, now seen corresponding path program 1 times [2019-10-15 01:28:39,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599979241] [2019-10-15 01:28:39,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,537 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:28:39,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599979241] [2019-10-15 01:28:39,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:39,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762094744] [2019-10-15 01:28:39,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:39,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:39,565 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 4 states. [2019-10-15 01:28:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,929 INFO L93 Difference]: Finished difference Result 464 states and 690 transitions. [2019-10-15 01:28:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:39,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:28:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,965 INFO L225 Difference]: With dead ends: 464 [2019-10-15 01:28:39,965 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 01:28:39,981 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:28:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 01:28:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-15 01:28:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2019-10-15 01:28:40,113 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 120 [2019-10-15 01:28:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,115 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2019-10-15 01:28:40,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2019-10-15 01:28:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:40,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,130 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] [2019-10-15 01:28:40,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -735539655, now seen corresponding path program 1 times [2019-10-15 01:28:40,132 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840082864] [2019-10-15 01:28:40,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,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:28:40,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840082864] [2019-10-15 01:28:40,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:40,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:40,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590601108] [2019-10-15 01:28:40,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:40,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:40,400 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand 5 states. [2019-10-15 01:28:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,094 INFO L93 Difference]: Finished difference Result 480 states and 694 transitions. [2019-10-15 01:28:41,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,104 INFO L225 Difference]: With dead ends: 480 [2019-10-15 01:28:41,104 INFO L226 Difference]: Without dead ends: 270 [2019-10-15 01:28:41,106 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:28:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-15 01:28:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 232. [2019-10-15 01:28:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 325 transitions. [2019-10-15 01:28:41,161 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 325 transitions. Word has length 120 [2019-10-15 01:28:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,163 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 325 transitions. [2019-10-15 01:28:41,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 325 transitions. [2019-10-15 01:28:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:41,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,168 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] [2019-10-15 01:28:41,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1792270857, now seen corresponding path program 1 times [2019-10-15 01:28:41,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070161402] [2019-10-15 01:28:41,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,330 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:28:41,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070161402] [2019-10-15 01:28:41,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:41,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637276844] [2019-10-15 01:28:41,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:41,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:41,333 INFO L87 Difference]: Start difference. First operand 232 states and 325 transitions. Second operand 5 states. [2019-10-15 01:28:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,859 INFO L93 Difference]: Finished difference Result 478 states and 689 transitions. [2019-10-15 01:28:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,863 INFO L225 Difference]: With dead ends: 478 [2019-10-15 01:28:41,863 INFO L226 Difference]: Without dead ends: 268 [2019-10-15 01:28:41,864 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:28:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-15 01:28:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-10-15 01:28:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-10-15 01:28:41,887 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 120 [2019-10-15 01:28:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,887 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-10-15 01:28:41,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-10-15 01:28:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:41,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,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] [2019-10-15 01:28:41,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash 883721525, now seen corresponding path program 1 times [2019-10-15 01:28:41,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038430601] [2019-10-15 01:28:41,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,965 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:28:41,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038430601] [2019-10-15 01:28:41,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:41,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161435747] [2019-10-15 01:28:41,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:41,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:41,968 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 5 states. [2019-10-15 01:28:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,623 INFO L93 Difference]: Finished difference Result 476 states and 683 transitions. [2019-10-15 01:28:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:42,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,626 INFO L225 Difference]: With dead ends: 476 [2019-10-15 01:28:42,626 INFO L226 Difference]: Without dead ends: 266 [2019-10-15 01:28:42,627 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:28:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-15 01:28:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2019-10-15 01:28:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2019-10-15 01:28:42,647 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 120 [2019-10-15 01:28:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,648 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2019-10-15 01:28:42,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2019-10-15 01:28:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:42,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,650 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] [2019-10-15 01:28:42,650 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 212535, now seen corresponding path program 1 times [2019-10-15 01:28:42,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135469677] [2019-10-15 01:28:42,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:42,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135469677] [2019-10-15 01:28:42,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:42,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607386670] [2019-10-15 01:28:42,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:42,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:42,776 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand 5 states. [2019-10-15 01:28:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,316 INFO L93 Difference]: Finished difference Result 474 states and 677 transitions. [2019-10-15 01:28:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:43,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,320 INFO L225 Difference]: With dead ends: 474 [2019-10-15 01:28:43,320 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:28:43,321 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:28:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:28:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-10-15 01:28:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 322 transitions. [2019-10-15 01:28:43,344 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 322 transitions. Word has length 120 [2019-10-15 01:28:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 322 transitions. [2019-10-15 01:28:43,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 322 transitions. [2019-10-15 01:28:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:43,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,347 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] [2019-10-15 01:28:43,348 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash -28287755, now seen corresponding path program 1 times [2019-10-15 01:28:43,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480017589] [2019-10-15 01:28:43,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,437 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:28:43,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480017589] [2019-10-15 01:28:43,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:43,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805371247] [2019-10-15 01:28:43,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:43,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:43,440 INFO L87 Difference]: Start difference. First operand 232 states and 322 transitions. Second operand 5 states. [2019-10-15 01:28:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,912 INFO L93 Difference]: Finished difference Result 497 states and 715 transitions. [2019-10-15 01:28:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:43,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,915 INFO L225 Difference]: With dead ends: 497 [2019-10-15 01:28:43,915 INFO L226 Difference]: Without dead ends: 287 [2019-10-15 01:28:43,917 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:28:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-15 01:28:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 232. [2019-10-15 01:28:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2019-10-15 01:28:43,940 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 120 [2019-10-15 01:28:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,941 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2019-10-15 01:28:43,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2019-10-15 01:28:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:43,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,944 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] [2019-10-15 01:28:43,944 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1968869769, now seen corresponding path program 1 times [2019-10-15 01:28:43,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739891395] [2019-10-15 01:28:43,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,010 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:28:44,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739891395] [2019-10-15 01:28:44,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:44,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731980783] [2019-10-15 01:28:44,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:44,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,013 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand 5 states. [2019-10-15 01:28:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,515 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2019-10-15 01:28:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:44,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,518 INFO L225 Difference]: With dead ends: 491 [2019-10-15 01:28:44,518 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 01:28:44,520 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:28:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 01:28:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 232. [2019-10-15 01:28:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 320 transitions. [2019-10-15 01:28:44,541 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 320 transitions. Word has length 120 [2019-10-15 01:28:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,541 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 320 transitions. [2019-10-15 01:28:44,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 320 transitions. [2019-10-15 01:28:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:44,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,543 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] [2019-10-15 01:28:44,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash -91806539, now seen corresponding path program 1 times [2019-10-15 01:28:44,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495532975] [2019-10-15 01:28:44,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,604 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:28:44,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495532975] [2019-10-15 01:28:44,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:44,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763189387] [2019-10-15 01:28:44,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:44,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,607 INFO L87 Difference]: Start difference. First operand 232 states and 320 transitions. Second operand 5 states. [2019-10-15 01:28:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,084 INFO L93 Difference]: Finished difference Result 493 states and 703 transitions. [2019-10-15 01:28:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:45,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,088 INFO L225 Difference]: With dead ends: 493 [2019-10-15 01:28:45,089 INFO L226 Difference]: Without dead ends: 283 [2019-10-15 01:28:45,090 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:28:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-15 01:28:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-10-15 01:28:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2019-10-15 01:28:45,117 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 120 [2019-10-15 01:28:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,118 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2019-10-15 01:28:45,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2019-10-15 01:28:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:45,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,121 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] [2019-10-15 01:28:45,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -862540105, now seen corresponding path program 1 times [2019-10-15 01:28:45,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732580361] [2019-10-15 01:28:45,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,223 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:28:45,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732580361] [2019-10-15 01:28:45,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:45,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036109179] [2019-10-15 01:28:45,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:45,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:45,226 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand 5 states. [2019-10-15 01:28:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,692 INFO L93 Difference]: Finished difference Result 491 states and 697 transitions. [2019-10-15 01:28:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:45,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:28:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,695 INFO L225 Difference]: With dead ends: 491 [2019-10-15 01:28:45,696 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 01:28:45,697 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:28:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 01:28:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 232. [2019-10-15 01:28:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:28:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2019-10-15 01:28:45,720 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 120 [2019-10-15 01:28:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,721 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2019-10-15 01:28:45,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2019-10-15 01:28:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:28:45,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,723 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] [2019-10-15 01:28:45,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1857233803, now seen corresponding path program 1 times [2019-10-15 01:28:45,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71563405] [2019-10-15 01:28:45,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,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:28:45,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71563405] [2019-10-15 01:28:45,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:45,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751918100] [2019-10-15 01:28:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:45,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:45,798 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand 4 states. [2019-10-15 01:28:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,077 INFO L93 Difference]: Finished difference Result 636 states and 906 transitions. [2019-10-15 01:28:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:46,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:28:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,081 INFO L225 Difference]: With dead ends: 636 [2019-10-15 01:28:46,081 INFO L226 Difference]: Without dead ends: 427 [2019-10-15 01:28:46,084 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:28:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-15 01:28:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 426. [2019-10-15 01:28:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-15 01:28:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 581 transitions. [2019-10-15 01:28:46,130 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 581 transitions. Word has length 120 [2019-10-15 01:28:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,130 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 581 transitions. [2019-10-15 01:28:46,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 581 transitions. [2019-10-15 01:28:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-15 01:28:46,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,134 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:46,134 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash 290354223, now seen corresponding path program 1 times [2019-10-15 01:28:46,134 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230287894] [2019-10-15 01:28:46,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:46,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230287894] [2019-10-15 01:28:46,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114827239] [2019-10-15 01:28:46,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:46,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:28:46,501 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:28:46,711 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:46,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:46,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308841186] [2019-10-15 01:28:46,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:46,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:46,713 INFO L87 Difference]: Start difference. First operand 426 states and 581 transitions. Second operand 3 states. [2019-10-15 01:28:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,790 INFO L93 Difference]: Finished difference Result 1208 states and 1695 transitions. [2019-10-15 01:28:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:46,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-15 01:28:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,797 INFO L225 Difference]: With dead ends: 1208 [2019-10-15 01:28:46,797 INFO L226 Difference]: Without dead ends: 806 [2019-10-15 01:28:46,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-10-15 01:28:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 796. [2019-10-15 01:28:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-10-15 01:28:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1119 transitions. [2019-10-15 01:28:46,870 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1119 transitions. Word has length 195 [2019-10-15 01:28:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1119 transitions. [2019-10-15 01:28:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1119 transitions. [2019-10-15 01:28:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-15 01:28:46,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,876 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:47,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:47,093 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1164055524, now seen corresponding path program 1 times [2019-10-15 01:28:47,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238041211] [2019-10-15 01:28:47,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:47,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238041211] [2019-10-15 01:28:47,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852041182] [2019-10-15 01:28:47,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:47,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:28:47,416 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-15 01:28:47,663 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:47,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:47,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554938811] [2019-10-15 01:28:47,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:47,665 INFO L87 Difference]: Start difference. First operand 796 states and 1119 transitions. Second operand 3 states. [2019-10-15 01:28:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,791 INFO L93 Difference]: Finished difference Result 2311 states and 3376 transitions. [2019-10-15 01:28:47,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-15 01:28:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,806 INFO L225 Difference]: With dead ends: 2311 [2019-10-15 01:28:47,806 INFO L226 Difference]: Without dead ends: 1539 [2019-10-15 01:28:47,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-10-15 01:28:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-10-15 01:28:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-10-15 01:28:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2236 transitions. [2019-10-15 01:28:47,980 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2236 transitions. Word has length 196 [2019-10-15 01:28:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,981 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 2236 transitions. [2019-10-15 01:28:47,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2236 transitions. [2019-10-15 01:28:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-15 01:28:47,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,990 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:48,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:48,205 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1500448006, now seen corresponding path program 1 times [2019-10-15 01:28:48,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779687549] [2019-10-15 01:28:48,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-15 01:28:48,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779687549] [2019-10-15 01:28:48,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990813682] [2019-10-15 01:28:48,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:48,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:28:48,590 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-15 01:28:48,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:48,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 7 [2019-10-15 01:28:48,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272844129] [2019-10-15 01:28:48,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:48,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:48,724 INFO L87 Difference]: Start difference. First operand 1523 states and 2236 transitions. Second operand 3 states. [2019-10-15 01:28:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,941 INFO L93 Difference]: Finished difference Result 4407 states and 6876 transitions. [2019-10-15 01:28:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-15 01:28:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,970 INFO L225 Difference]: With dead ends: 4407 [2019-10-15 01:28:48,971 INFO L226 Difference]: Without dead ends: 2915 [2019-10-15 01:28:48,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2019-10-15 01:28:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2911. [2019-10-15 01:28:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2019-10-15 01:28:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4513 transitions. [2019-10-15 01:28:49,303 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4513 transitions. Word has length 218 [2019-10-15 01:28:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,303 INFO L462 AbstractCegarLoop]: Abstraction has 2911 states and 4513 transitions. [2019-10-15 01:28:49,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4513 transitions. [2019-10-15 01:28:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-15 01:28:49,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,315 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:49,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 181430476, now seen corresponding path program 1 times [2019-10-15 01:28:49,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134281410] [2019-10-15 01:28:49,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-15 01:28:49,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134281410] [2019-10-15 01:28:49,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:49,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727183454] [2019-10-15 01:28:49,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:49,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:49,623 INFO L87 Difference]: Start difference. First operand 2911 states and 4513 transitions. Second operand 4 states. [2019-10-15 01:28:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,970 INFO L93 Difference]: Finished difference Result 5305 states and 8093 transitions. [2019-10-15 01:28:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:49,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-15 01:28:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,989 INFO L225 Difference]: With dead ends: 5305 [2019-10-15 01:28:49,989 INFO L226 Difference]: Without dead ends: 2423 [2019-10-15 01:28:50,004 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:28:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-10-15 01:28:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-10-15 01:28:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-10-15 01:28:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3620 transitions. [2019-10-15 01:28:50,290 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3620 transitions. Word has length 219 [2019-10-15 01:28:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,291 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3620 transitions. [2019-10-15 01:28:50,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3620 transitions. [2019-10-15 01:28:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-15 01:28:50,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,300 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:50,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 928960072, now seen corresponding path program 1 times [2019-10-15 01:28:50,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685955370] [2019-10-15 01:28:50,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-15 01:28:50,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685955370] [2019-10-15 01:28:50,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:50,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026535612] [2019-10-15 01:28:50,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:50,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:50,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:50,375 INFO L87 Difference]: Start difference. First operand 2423 states and 3620 transitions. Second operand 4 states. [2019-10-15 01:28:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,721 INFO L93 Difference]: Finished difference Result 4816 states and 7198 transitions. [2019-10-15 01:28:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:50,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-15 01:28:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,746 INFO L225 Difference]: With dead ends: 4816 [2019-10-15 01:28:50,746 INFO L226 Difference]: Without dead ends: 2416 [2019-10-15 01:28:50,762 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:28:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-10-15 01:28:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2416. [2019-10-15 01:28:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-10-15 01:28:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3606 transitions. [2019-10-15 01:28:51,031 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3606 transitions. Word has length 219 [2019-10-15 01:28:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,031 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 3606 transitions. [2019-10-15 01:28:51,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3606 transitions. [2019-10-15 01:28:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-15 01:28:51,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,039 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:51,039 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1218574354, now seen corresponding path program 1 times [2019-10-15 01:28:51,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315116480] [2019-10-15 01:28:51,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:51,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315116480] [2019-10-15 01:28:51,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357021656] [2019-10-15 01:28:51,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:51,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-15 01:28:51,451 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:28:51,614 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:51,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:51,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682320130] [2019-10-15 01:28:51,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:51,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:51,617 INFO L87 Difference]: Start difference. First operand 2416 states and 3606 transitions. Second operand 3 states. [2019-10-15 01:28:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,930 INFO L93 Difference]: Finished difference Result 7109 states and 11391 transitions. [2019-10-15 01:28:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:51,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-15 01:28:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,969 INFO L225 Difference]: With dead ends: 7109 [2019-10-15 01:28:51,969 INFO L226 Difference]: Without dead ends: 4717 [2019-10-15 01:28:51,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4717 states. [2019-10-15 01:28:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4717 to 4677. [2019-10-15 01:28:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4677 states. [2019-10-15 01:28:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 7535 transitions. [2019-10-15 01:28:52,507 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 7535 transitions. Word has length 197 [2019-10-15 01:28:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,507 INFO L462 AbstractCegarLoop]: Abstraction has 4677 states and 7535 transitions. [2019-10-15 01:28:52,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 7535 transitions. [2019-10-15 01:28:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-15 01:28:52,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,519 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,724 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1813876500, now seen corresponding path program 1 times [2019-10-15 01:28:52,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115627327] [2019-10-15 01:28:52,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 01:28:52,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115627327] [2019-10-15 01:28:52,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:52,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459415185] [2019-10-15 01:28:52,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:52,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:52,816 INFO L87 Difference]: Start difference. First operand 4677 states and 7535 transitions. Second operand 4 states. [2019-10-15 01:28:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,253 INFO L93 Difference]: Finished difference Result 9325 states and 15031 transitions. [2019-10-15 01:28:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:53,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-10-15 01:28:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,288 INFO L225 Difference]: With dead ends: 9325 [2019-10-15 01:28:53,288 INFO L226 Difference]: Without dead ends: 4671 [2019-10-15 01:28:53,317 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:28:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2019-10-15 01:28:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2019-10-15 01:28:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2019-10-15 01:28:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7523 transitions. [2019-10-15 01:28:53,787 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7523 transitions. Word has length 197 [2019-10-15 01:28:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,788 INFO L462 AbstractCegarLoop]: Abstraction has 4671 states and 7523 transitions. [2019-10-15 01:28:53,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7523 transitions. [2019-10-15 01:28:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-15 01:28:53,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,797 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,797 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -522364891, now seen corresponding path program 1 times [2019-10-15 01:28:53,798 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104867836] [2019-10-15 01:28:53,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:53,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104867836] [2019-10-15 01:28:53,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468664588] [2019-10-15 01:28:53,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:54,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-15 01:28:54,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 01:28:54,413 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:54,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:54,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964950008] [2019-10-15 01:28:54,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:54,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:54,416 INFO L87 Difference]: Start difference. First operand 4671 states and 7523 transitions. Second operand 3 states. [2019-10-15 01:28:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,285 INFO L93 Difference]: Finished difference Result 13776 states and 24832 transitions. [2019-10-15 01:28:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:55,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-15 01:28:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,390 INFO L225 Difference]: With dead ends: 13776 [2019-10-15 01:28:55,391 INFO L226 Difference]: Without dead ends: 9129 [2019-10-15 01:28:55,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9129 states. [2019-10-15 01:28:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9129 to 9053. [2019-10-15 01:28:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9053 states. [2019-10-15 01:28:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9053 states to 9053 states and 16338 transitions. [2019-10-15 01:28:56,895 INFO L78 Accepts]: Start accepts. Automaton has 9053 states and 16338 transitions. Word has length 198 [2019-10-15 01:28:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,896 INFO L462 AbstractCegarLoop]: Abstraction has 9053 states and 16338 transitions. [2019-10-15 01:28:56,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9053 states and 16338 transitions. [2019-10-15 01:28:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-15 01:28:56,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,913 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,120 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1401585955, now seen corresponding path program 1 times [2019-10-15 01:28:57,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134166845] [2019-10-15 01:28:57,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 01:28:57,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134166845] [2019-10-15 01:28:57,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:57,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:57,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172368704] [2019-10-15 01:28:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:57,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:57,184 INFO L87 Difference]: Start difference. First operand 9053 states and 16338 transitions. Second operand 4 states. [2019-10-15 01:28:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,039 INFO L93 Difference]: Finished difference Result 18078 states and 32640 transitions. [2019-10-15 01:28:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:58,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-10-15 01:28:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,132 INFO L225 Difference]: With dead ends: 18078 [2019-10-15 01:28:58,133 INFO L226 Difference]: Without dead ends: 9048 [2019-10-15 01:28:58,300 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:28:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9048 states. [2019-10-15 01:28:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9048 to 9048. [2019-10-15 01:28:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-10-15 01:28:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 16328 transitions. [2019-10-15 01:28:59,033 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 16328 transitions. Word has length 198 [2019-10-15 01:28:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,033 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 16328 transitions. [2019-10-15 01:28:59,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 16328 transitions. [2019-10-15 01:28:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-15 01:28:59,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,046 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,046 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1159096237, now seen corresponding path program 1 times [2019-10-15 01:28:59,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010474116] [2019-10-15 01:28:59,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:59,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010474116] [2019-10-15 01:28:59,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562354071] [2019-10-15 01:28:59,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:59,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:28:59,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-15 01:28:59,668 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:59,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 9 [2019-10-15 01:28:59,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620820752] [2019-10-15 01:28:59,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:59,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:59,672 INFO L87 Difference]: Start difference. First operand 9048 states and 16328 transitions. Second operand 5 states. [2019-10-15 01:29:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,190 INFO L93 Difference]: Finished difference Result 15416 states and 29225 transitions. [2019-10-15 01:29:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:01,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-10-15 01:29:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,251 INFO L225 Difference]: With dead ends: 15416 [2019-10-15 01:29:01,252 INFO L226 Difference]: Without dead ends: 9959 [2019-10-15 01:29:01,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:29:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2019-10-15 01:29:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 9943. [2019-10-15 01:29:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9943 states. [2019-10-15 01:29:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 17479 transitions. [2019-10-15 01:29:02,944 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 17479 transitions. Word has length 199 [2019-10-15 01:29:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,945 INFO L462 AbstractCegarLoop]: Abstraction has 9943 states and 17479 transitions. [2019-10-15 01:29:02,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 17479 transitions. [2019-10-15 01:29:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-15 01:29:02,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,985 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:03,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,191 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1598328827, now seen corresponding path program 1 times [2019-10-15 01:29:03,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866218863] [2019-10-15 01:29:03,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-15 01:29:03,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866218863] [2019-10-15 01:29:03,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016445480] [2019-10-15 01:29:03,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:03,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:29:03,650 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-15 01:29:03,908 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:03,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-10-15 01:29:03,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707071131] [2019-10-15 01:29:03,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:03,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:03,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:03,911 INFO L87 Difference]: Start difference. First operand 9943 states and 17479 transitions. Second operand 4 states. [2019-10-15 01:29:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,773 INFO L93 Difference]: Finished difference Result 24788 states and 50335 transitions. [2019-10-15 01:29:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:05,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-10-15 01:29:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,862 INFO L225 Difference]: With dead ends: 24788 [2019-10-15 01:29:05,863 INFO L226 Difference]: Without dead ends: 14868 [2019-10-15 01:29:05,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-10-15 01:29:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14816. [2019-10-15 01:29:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14816 states.