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.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:32,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:32,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:32,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:32,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:32,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:32,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:32,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:32,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:32,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:32,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:32,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:32,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:32,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:32,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:32,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:32,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:32,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:32,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:32,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:32,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:32,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:32,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:32,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:32,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:32,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:32,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:32,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:32,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:32,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:32,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:32,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:32,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:32,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:32,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:32,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:32,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:32,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:32,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:32,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:32,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:32,639 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:32,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:32,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:32,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:32,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:32,678 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:32,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:32,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:32,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:32,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:32,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:32,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:32,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:32,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:32,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:32,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:32,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:32,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:32,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:32,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:32,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:32,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:32,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:32,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:32,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:32,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:32,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:32,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:32,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:32,686 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:32,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:33,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:33,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:33,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:33,015 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:33,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-15 01:28:33,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804574802/cbd244736c664b5fa4867c815c03581e/FLAG181a5b120 [2019-10-15 01:28:33,610 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:33,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-15 01:28:33,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804574802/cbd244736c664b5fa4867c815c03581e/FLAG181a5b120 [2019-10-15 01:28:33,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804574802/cbd244736c664b5fa4867c815c03581e [2019-10-15 01:28:33,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:33,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:33,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:33,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:33,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:33,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:33" (1/1) ... [2019-10-15 01:28:33,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3349a570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:33, skipping insertion in model container [2019-10-15 01:28:33,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:33" (1/1) ... [2019-10-15 01:28:33,978 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:34,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:34,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:34,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:34,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:34,459 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:34,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:34 WrapperNode [2019-10-15 01:28:34,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:34,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:34,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:34,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:34,470 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:34" (1/1) ... [2019-10-15 01:28:34,470 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:34" (1/1) ... [2019-10-15 01:28:34,477 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:34" (1/1) ... [2019-10-15 01:28:34,478 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:34" (1/1) ... [2019-10-15 01:28:34,487 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:34" (1/1) ... [2019-10-15 01:28:34,499 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:34" (1/1) ... [2019-10-15 01:28:34,502 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:34" (1/1) ... [2019-10-15 01:28:34,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:34,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:34,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:34,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:34,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:34" (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:34,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:35,171 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:35,172 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 01:28:35,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:35 BoogieIcfgContainer [2019-10-15 01:28:35,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:35,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:35,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:35,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:35,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:33" (1/3) ... [2019-10-15 01:28:35,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:35, skipping insertion in model container [2019-10-15 01:28:35,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:34" (2/3) ... [2019-10-15 01:28:35,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:35, skipping insertion in model container [2019-10-15 01:28:35,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:35" (3/3) ... [2019-10-15 01:28:35,191 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-10-15 01:28:35,203 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:35,226 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:35,240 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:35,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:35,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:35,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:35,283 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:35,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:35,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:35,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:35,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-10-15 01:28:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:35,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:35,329 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] [2019-10-15 01:28:35,331 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-10-15 01:28:35,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:35,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185169445] [2019-10-15 01:28:35,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:35,698 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:35,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185169445] [2019-10-15 01:28:35,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:35,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:35,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605291947] [2019-10-15 01:28:35,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:35,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:35,728 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-10-15 01:28:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:36,414 INFO L93 Difference]: Finished difference Result 361 states and 528 transitions. [2019-10-15 01:28:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:36,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:36,433 INFO L225 Difference]: With dead ends: 361 [2019-10-15 01:28:36,433 INFO L226 Difference]: Without dead ends: 195 [2019-10-15 01:28:36,439 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:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-15 01:28:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-10-15 01:28:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-10-15 01:28:36,575 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-10-15 01:28:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:36,576 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-10-15 01:28:36,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-10-15 01:28:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:36,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:36,594 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] [2019-10-15 01:28:36,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-10-15 01:28:36,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:36,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141762653] [2019-10-15 01:28:36,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:36,791 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:36,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141762653] [2019-10-15 01:28:36,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:36,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:36,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68035095] [2019-10-15 01:28:36,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:36,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:36,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:36,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:36,796 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-10-15 01:28:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,339 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2019-10-15 01:28:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:37,343 INFO L225 Difference]: With dead ends: 338 [2019-10-15 01:28:37,343 INFO L226 Difference]: Without dead ends: 193 [2019-10-15 01:28:37,345 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:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-15 01:28:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-10-15 01:28:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-10-15 01:28:37,371 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-10-15 01:28:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:37,371 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-10-15 01:28:37,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-10-15 01:28:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:37,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:37,374 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] [2019-10-15 01:28:37,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-10-15 01:28:37,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:37,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133020937] [2019-10-15 01:28:37,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:37,502 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:37,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133020937] [2019-10-15 01:28:37,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:37,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:37,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445733426] [2019-10-15 01:28:37,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:37,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:37,505 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-10-15 01:28:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,915 INFO L93 Difference]: Finished difference Result 355 states and 496 transitions. [2019-10-15 01:28:37,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:37,923 INFO L225 Difference]: With dead ends: 355 [2019-10-15 01:28:37,924 INFO L226 Difference]: Without dead ends: 210 [2019-10-15 01:28:37,927 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:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-15 01:28:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-10-15 01:28:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-10-15 01:28:37,961 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-10-15 01:28:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:37,962 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-10-15 01:28:37,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-10-15 01:28:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:37,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:37,976 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] [2019-10-15 01:28:37,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-10-15 01:28:37,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:37,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348089874] [2019-10-15 01:28:37,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:37,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,075 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:38,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348089874] [2019-10-15 01:28:38,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314126240] [2019-10-15 01:28:38,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,078 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-10-15 01:28:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:38,451 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2019-10-15 01:28:38,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:38,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,454 INFO L225 Difference]: With dead ends: 349 [2019-10-15 01:28:38,454 INFO L226 Difference]: Without dead ends: 204 [2019-10-15 01:28:38,455 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:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-15 01:28:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-10-15 01:28:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-10-15 01:28:38,476 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-10-15 01:28:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:38,477 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-10-15 01:28:38,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-10-15 01:28:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:38,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,479 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] [2019-10-15 01:28:38,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-10-15 01:28:38,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470964195] [2019-10-15 01:28:38,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,567 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:38,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470964195] [2019-10-15 01:28:38,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073897010] [2019-10-15 01:28:38,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,570 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-10-15 01:28:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:38,933 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2019-10-15 01:28:38,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:38,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,936 INFO L225 Difference]: With dead ends: 351 [2019-10-15 01:28:38,937 INFO L226 Difference]: Without dead ends: 206 [2019-10-15 01:28:38,938 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:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-15 01:28:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-10-15 01:28:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-10-15 01:28:38,959 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-10-15 01:28:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:38,959 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-10-15 01:28:38,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-10-15 01:28:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:38,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,961 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] [2019-10-15 01:28:38,962 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-10-15 01:28:38,963 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036816371] [2019-10-15 01:28:38,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:39,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036816371] [2019-10-15 01:28:39,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:39,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667396324] [2019-10-15 01:28:39,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:39,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:39,040 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-10-15 01:28:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,247 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2019-10-15 01:28:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:39,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:28:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,251 INFO L225 Difference]: With dead ends: 445 [2019-10-15 01:28:39,251 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 01:28:39,252 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:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 01:28:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-10-15 01:28:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-15 01:28:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-10-15 01:28:39,285 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-10-15 01:28:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-10-15 01:28:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-10-15 01:28:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:28:39,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,289 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-10-15 01:28:39,290 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386738743] [2019-10-15 01:28:39,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:39,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386738743] [2019-10-15 01:28:39,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740112710] [2019-10-15 01:28:39,399 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:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:39,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:28:39,602 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:39,751 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:39,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:28:39,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074656650] [2019-10-15 01:28:39,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:39,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:39,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:39,753 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 3 states. [2019-10-15 01:28:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,812 INFO L93 Difference]: Finished difference Result 844 states and 1154 transitions. [2019-10-15 01:28:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:39,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-15 01:28:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,819 INFO L225 Difference]: With dead ends: 844 [2019-10-15 01:28:39,819 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:28:39,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 290 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:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:28:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2019-10-15 01:28:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-15 01:28:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 762 transitions. [2019-10-15 01:28:39,898 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 762 transitions. Word has length 145 [2019-10-15 01:28:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,902 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 762 transitions. [2019-10-15 01:28:39,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 762 transitions. [2019-10-15 01:28:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:28:39,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:40,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2051317408, now seen corresponding path program 1 times [2019-10-15 01:28:40,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926600147] [2019-10-15 01:28:40,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:28:40,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926600147] [2019-10-15 01:28:40,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:40,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:40,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853524465] [2019-10-15 01:28:40,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:40,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:40,174 INFO L87 Difference]: Start difference. First operand 557 states and 762 transitions. Second operand 4 states. [2019-10-15 01:28:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,313 INFO L93 Difference]: Finished difference Result 1087 states and 1486 transitions. [2019-10-15 01:28:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:40,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-15 01:28:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,319 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:28:40,319 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:28:40,322 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,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:28:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:28:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:28:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 750 transitions. [2019-10-15 01:28:40,375 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 750 transitions. Word has length 145 [2019-10-15 01:28:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,378 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 750 transitions. [2019-10-15 01:28:40,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 750 transitions. [2019-10-15 01:28:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:28:40,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash -522429444, now seen corresponding path program 1 times [2019-10-15 01:28:40,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394343564] [2019-10-15 01:28:40,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:40,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394343564] [2019-10-15 01:28:40,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955299845] [2019-10-15 01:28:40,469 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:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:40,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:40,694 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:28:40,867 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:40,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 9 [2019-10-15 01:28:40,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537526677] [2019-10-15 01:28:40,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:40,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:40,870 INFO L87 Difference]: Start difference. First operand 551 states and 750 transitions. Second operand 5 states. [2019-10-15 01:28:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,200 INFO L93 Difference]: Finished difference Result 1721 states and 2426 transitions. [2019-10-15 01:28:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-15 01:28:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,211 INFO L225 Difference]: With dead ends: 1721 [2019-10-15 01:28:41,211 INFO L226 Difference]: Without dead ends: 1192 [2019-10-15 01:28:41,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 289 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:28:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-10-15 01:28:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1190. [2019-10-15 01:28:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-10-15 01:28:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1658 transitions. [2019-10-15 01:28:41,338 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1658 transitions. Word has length 146 [2019-10-15 01:28:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,340 INFO L462 AbstractCegarLoop]: Abstraction has 1190 states and 1658 transitions. [2019-10-15 01:28:41,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1658 transitions. [2019-10-15 01:28:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-15 01:28:41,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,355 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:41,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:41,569 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -10087042, now seen corresponding path program 1 times [2019-10-15 01:28:41,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36288822] [2019-10-15 01:28:41,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-15 01:28:41,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36288822] [2019-10-15 01:28:41,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:41,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446840516] [2019-10-15 01:28:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:41,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:41,769 INFO L87 Difference]: Start difference. First operand 1190 states and 1658 transitions. Second operand 4 states. [2019-10-15 01:28:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,975 INFO L93 Difference]: Finished difference Result 2108 states and 2923 transitions. [2019-10-15 01:28:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:41,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-10-15 01:28:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,983 INFO L225 Difference]: With dead ends: 2108 [2019-10-15 01:28:41,983 INFO L226 Difference]: Without dead ends: 939 [2019-10-15 01:28:41,989 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:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-10-15 01:28:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2019-10-15 01:28:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-10-15 01:28:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1290 transitions. [2019-10-15 01:28:42,067 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1290 transitions. Word has length 254 [2019-10-15 01:28:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,067 INFO L462 AbstractCegarLoop]: Abstraction has 939 states and 1290 transitions. [2019-10-15 01:28:42,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1290 transitions. [2019-10-15 01:28:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-15 01:28:42,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,072 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, 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:42,072 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -217931108, now seen corresponding path program 1 times [2019-10-15 01:28:42,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314583073] [2019-10-15 01:28:42,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-15 01:28:42,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314583073] [2019-10-15 01:28:42,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132852639] [2019-10-15 01:28:42,173 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:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:28:42,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-15 01:28:42,439 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-15 01:28:42,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:42,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2019-10-15 01:28:42,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526244893] [2019-10-15 01:28:42,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:42,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:42,896 INFO L87 Difference]: Start difference. First operand 939 states and 1290 transitions. Second operand 3 states. [2019-10-15 01:28:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,073 INFO L93 Difference]: Finished difference Result 2731 states and 3902 transitions. [2019-10-15 01:28:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:43,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-15 01:28:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,088 INFO L225 Difference]: With dead ends: 2731 [2019-10-15 01:28:43,088 INFO L226 Difference]: Without dead ends: 1813 [2019-10-15 01:28:43,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 6 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:28:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-10-15 01:28:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1796. [2019-10-15 01:28:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-10-15 01:28:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2480 transitions. [2019-10-15 01:28:43,279 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2480 transitions. Word has length 190 [2019-10-15 01:28:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,279 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2480 transitions. [2019-10-15 01:28:43,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2480 transitions. [2019-10-15 01:28:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-15 01:28:43,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,288 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, 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:43,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:43,495 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash 723777645, now seen corresponding path program 1 times [2019-10-15 01:28:43,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971004369] [2019-10-15 01:28:43,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-15 01:28:43,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971004369] [2019-10-15 01:28:43,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420605131] [2019-10-15 01:28:43,578 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:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:43,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:43,800 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-15 01:28:44,106 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:44,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-10-15 01:28:44,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894875] [2019-10-15 01:28:44,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:44,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:44,112 INFO L87 Difference]: Start difference. First operand 1796 states and 2480 transitions. Second operand 4 states. [2019-10-15 01:28:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,514 INFO L93 Difference]: Finished difference Result 4447 states and 6505 transitions. [2019-10-15 01:28:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:44,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-10-15 01:28:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,534 INFO L225 Difference]: With dead ends: 4447 [2019-10-15 01:28:44,534 INFO L226 Difference]: Without dead ends: 2672 [2019-10-15 01:28:44,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 377 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:28:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-10-15 01:28:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 2653. [2019-10-15 01:28:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-10-15 01:28:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3596 transitions. [2019-10-15 01:28:44,827 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3596 transitions. Word has length 189 [2019-10-15 01:28:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,828 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 3596 transitions. [2019-10-15 01:28:44,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3596 transitions. [2019-10-15 01:28:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-15 01:28:44,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,841 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, 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] [2019-10-15 01:28:45,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:45,047 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1809844547, now seen corresponding path program 1 times [2019-10-15 01:28:45,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772918552] [2019-10-15 01:28:45,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-15 01:28:45,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772918552] [2019-10-15 01:28:45,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066570643] [2019-10-15 01:28:45,177 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:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:28:45,409 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 01:28:45,587 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:45,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-10-15 01:28:45,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595924109] [2019-10-15 01:28:45,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:45,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:45,589 INFO L87 Difference]: Start difference. First operand 2653 states and 3596 transitions. Second operand 4 states. [2019-10-15 01:28:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,919 INFO L93 Difference]: Finished difference Result 5558 states and 7751 transitions. [2019-10-15 01:28:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:45,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-10-15 01:28:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,947 INFO L225 Difference]: With dead ends: 5558 [2019-10-15 01:28:45,948 INFO L226 Difference]: Without dead ends: 2927 [2019-10-15 01:28:45,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 SyntacticMatches, 6 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:28:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-10-15 01:28:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2649. [2019-10-15 01:28:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2649 states. [2019-10-15 01:28:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3513 transitions. [2019-10-15 01:28:46,255 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3513 transitions. Word has length 209 [2019-10-15 01:28:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,255 INFO L462 AbstractCegarLoop]: Abstraction has 2649 states and 3513 transitions. [2019-10-15 01:28:46,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3513 transitions. [2019-10-15 01:28:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-15 01:28:46,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,270 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:46,475 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2070994663, now seen corresponding path program 1 times [2019-10-15 01:28:46,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146127918] [2019-10-15 01:28:46,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-15 01:28:46,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146127918] [2019-10-15 01:28:46,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456469713] [2019-10-15 01:28:46,581 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:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:46,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-15 01:28:46,951 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-10-15 01:28:47,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:47,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 7 [2019-10-15 01:28:47,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235268578] [2019-10-15 01:28:47,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:47,171 INFO L87 Difference]: Start difference. First operand 2649 states and 3513 transitions. Second operand 3 states. [2019-10-15 01:28:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,374 INFO L93 Difference]: Finished difference Result 5544 states and 7503 transitions. [2019-10-15 01:28:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-15 01:28:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,401 INFO L225 Difference]: With dead ends: 5544 [2019-10-15 01:28:47,401 INFO L226 Difference]: Without dead ends: 2917 [2019-10-15 01:28:47,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 604 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,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-10-15 01:28:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2633. [2019-10-15 01:28:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2019-10-15 01:28:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3449 transitions. [2019-10-15 01:28:47,745 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3449 transitions. Word has length 302 [2019-10-15 01:28:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,746 INFO L462 AbstractCegarLoop]: Abstraction has 2633 states and 3449 transitions. [2019-10-15 01:28:47,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3449 transitions. [2019-10-15 01:28:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-15 01:28:47,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,763 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, 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] [2019-10-15 01:28:47,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:47,979 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1712386816, now seen corresponding path program 1 times [2019-10-15 01:28:47,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636400178] [2019-10-15 01:28:47,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-15 01:28:48,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636400178] [2019-10-15 01:28:48,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319419845] [2019-10-15 01:28:48,161 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:28:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:48,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-15 01:28:48,419 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-15 01:28:48,646 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:48,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2019-10-15 01:28:48,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545751924] [2019-10-15 01:28:48,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:48,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:48,648 INFO L87 Difference]: Start difference. First operand 2633 states and 3449 transitions. Second operand 6 states. [2019-10-15 01:28:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,455 INFO L93 Difference]: Finished difference Result 6043 states and 8501 transitions. [2019-10-15 01:28:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:49,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-10-15 01:28:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,481 INFO L225 Difference]: With dead ends: 6043 [2019-10-15 01:28:49,481 INFO L226 Difference]: Without dead ends: 3432 [2019-10-15 01:28:49,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 413 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:28:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-10-15 01:28:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2982. [2019-10-15 01:28:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-10-15 01:28:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 3796 transitions. [2019-10-15 01:28:49,772 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 3796 transitions. Word has length 210 [2019-10-15 01:28:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,772 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 3796 transitions. [2019-10-15 01:28:49,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3796 transitions. [2019-10-15 01:28:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:28:49,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,786 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, 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] [2019-10-15 01:28:49,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,993 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -564748886, now seen corresponding path program 1 times [2019-10-15 01:28:49,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422191231] [2019-10-15 01:28:49,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:28:50,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422191231] [2019-10-15 01:28:50,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851350065] [2019-10-15 01:28:50,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:50,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-15 01:28:50,354 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:50,603 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:50,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2019-10-15 01:28:50,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239157087] [2019-10-15 01:28:50,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:50,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:50,607 INFO L87 Difference]: Start difference. First operand 2982 states and 3796 transitions. Second operand 6 states. [2019-10-15 01:28:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,693 INFO L93 Difference]: Finished difference Result 9354 states and 12193 transitions. [2019-10-15 01:28:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:51,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-15 01:28:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,735 INFO L225 Difference]: With dead ends: 9354 [2019-10-15 01:28:51,735 INFO L226 Difference]: Without dead ends: 6392 [2019-10-15 01:28:51,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 414 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:28:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6392 states. [2019-10-15 01:28:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6392 to 5939. [2019-10-15 01:28:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5939 states. [2019-10-15 01:28:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5939 states to 5939 states and 7531 transitions. [2019-10-15 01:28:52,334 INFO L78 Accepts]: Start accepts. Automaton has 5939 states and 7531 transitions. Word has length 211 [2019-10-15 01:28:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,335 INFO L462 AbstractCegarLoop]: Abstraction has 5939 states and 7531 transitions. [2019-10-15 01:28:52,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5939 states and 7531 transitions. [2019-10-15 01:28:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-15 01:28:52,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,349 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,553 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1810681114, now seen corresponding path program 1 times [2019-10-15 01:28:52,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040981508] [2019-10-15 01:28:52,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-10-15 01:28:52,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040981508] [2019-10-15 01:28:52,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379728433] [2019-10-15 01:28:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:53,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-15 01:28:53,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:53,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:53,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:28:53,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073618461] [2019-10-15 01:28:53,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:53,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:53,639 INFO L87 Difference]: Start difference. First operand 5939 states and 7531 transitions. Second operand 5 states. [2019-10-15 01:28:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,828 INFO L93 Difference]: Finished difference Result 11856 states and 15126 transitions. [2019-10-15 01:28:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2019-10-15 01:28:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,884 INFO L225 Difference]: With dead ends: 11856 [2019-10-15 01:28:54,885 INFO L226 Difference]: Without dead ends: 5939 [2019-10-15 01:28:54,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 599 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:28:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2019-10-15 01:28:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 5939. [2019-10-15 01:28:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5939 states. [2019-10-15 01:28:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5939 states to 5939 states and 7441 transitions. [2019-10-15 01:28:55,375 INFO L78 Accepts]: Start accepts. Automaton has 5939 states and 7441 transitions. Word has length 304 [2019-10-15 01:28:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,375 INFO L462 AbstractCegarLoop]: Abstraction has 5939 states and 7441 transitions. [2019-10-15 01:28:55,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5939 states and 7441 transitions. [2019-10-15 01:28:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:28:55,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,387 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, 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] [2019-10-15 01:28:55,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,593 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1752239150, now seen corresponding path program 1 times [2019-10-15 01:28:55,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31945990] [2019-10-15 01:28:55,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:28:55,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31945990] [2019-10-15 01:28:55,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770511754] [2019-10-15 01:28:55,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:28:56,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-15 01:28:56,099 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:56,298 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:56,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2019-10-15 01:28:56,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853112390] [2019-10-15 01:28:56,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:56,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:56,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:56,301 INFO L87 Difference]: Start difference. First operand 5939 states and 7441 transitions. Second operand 6 states. [2019-10-15 01:28:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,303 INFO L93 Difference]: Finished difference Result 13240 states and 18014 transitions. [2019-10-15 01:28:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:57,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-15 01:28:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,342 INFO L225 Difference]: With dead ends: 13240 [2019-10-15 01:28:57,342 INFO L226 Difference]: Without dead ends: 7323 [2019-10-15 01:28:57,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 415 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:28:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7323 states. [2019-10-15 01:28:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7323 to 6545. [2019-10-15 01:28:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6545 states. [2019-10-15 01:28:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6545 states to 6545 states and 8113 transitions. [2019-10-15 01:28:58,041 INFO L78 Accepts]: Start accepts. Automaton has 6545 states and 8113 transitions. Word has length 211 [2019-10-15 01:28:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,042 INFO L462 AbstractCegarLoop]: Abstraction has 6545 states and 8113 transitions. [2019-10-15 01:28:58,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6545 states and 8113 transitions. [2019-10-15 01:28:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:28:58,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,052 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, 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] [2019-10-15 01:28:58,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:58,264 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2090526700, now seen corresponding path program 1 times [2019-10-15 01:28:58,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164938458] [2019-10-15 01:28:58,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:28:58,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164938458] [2019-10-15 01:28:58,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666822928] [2019-10-15 01:28:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 01:28:58,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-15 01:28:58,599 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-15 01:28:58,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:58,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2019-10-15 01:28:58,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710823090] [2019-10-15 01:28:58,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:58,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:58,782 INFO L87 Difference]: Start difference. First operand 6545 states and 8113 transitions. Second operand 6 states. [2019-10-15 01:28:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,075 INFO L93 Difference]: Finished difference Result 13189 states and 16896 transitions. [2019-10-15 01:28:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:59,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-15 01:28:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,104 INFO L225 Difference]: With dead ends: 13189 [2019-10-15 01:28:59,104 INFO L226 Difference]: Without dead ends: 6665 [2019-10-15 01:28:59,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2019-10-15 01:28:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6665. [2019-10-15 01:28:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6665 states. [2019-10-15 01:28:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 8119 transitions. [2019-10-15 01:28:59,624 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 8119 transitions. Word has length 211 [2019-10-15 01:28:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,625 INFO L462 AbstractCegarLoop]: Abstraction has 6665 states and 8119 transitions. [2019-10-15 01:28:59,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 8119 transitions. [2019-10-15 01:28:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:28:59,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,634 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, 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] [2019-10-15 01:28:59,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,839 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -974637268, now seen corresponding path program 1 times [2019-10-15 01:28:59,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242885296] [2019-10-15 01:28:59,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-15 01:28:59,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242885296] [2019-10-15 01:28:59,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:59,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194386250] [2019-10-15 01:28:59,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:59,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:59,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:59,936 INFO L87 Difference]: Start difference. First operand 6665 states and 8119 transitions. Second operand 6 states. [2019-10-15 01:29:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,440 INFO L93 Difference]: Finished difference Result 12345 states and 15482 transitions. [2019-10-15 01:29:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:00,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-15 01:29:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,470 INFO L225 Difference]: With dead ends: 12345 [2019-10-15 01:29:00,471 INFO L226 Difference]: Without dead ends: 5701 [2019-10-15 01:29:00,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-10-15 01:29:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5701. [2019-10-15 01:29:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-10-15 01:29:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 6802 transitions. [2019-10-15 01:29:00,872 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 6802 transitions. Word has length 211 [2019-10-15 01:29:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,872 INFO L462 AbstractCegarLoop]: Abstraction has 5701 states and 6802 transitions. [2019-10-15 01:29:00,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 6802 transitions. [2019-10-15 01:29:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:29:00,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,880 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, 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] [2019-10-15 01:29:00,880 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash -865994635, now seen corresponding path program 1 times [2019-10-15 01:29:00,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423590724] [2019-10-15 01:29:00,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-15 01:29:01,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423590724] [2019-10-15 01:29:01,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858899216] [2019-10-15 01:29:01,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:01,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:29:01,314 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-15 01:29:01,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:01,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-15 01:29:01,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430682024] [2019-10-15 01:29:01,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:01,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:01,496 INFO L87 Difference]: Start difference. First operand 5701 states and 6802 transitions. Second operand 3 states. [2019-10-15 01:29:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,843 INFO L93 Difference]: Finished difference Result 9544 states and 11820 transitions. [2019-10-15 01:29:01,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:01,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-15 01:29:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,865 INFO L225 Difference]: With dead ends: 9544 [2019-10-15 01:29:01,865 INFO L226 Difference]: Without dead ends: 5677 [2019-10-15 01:29:01,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2019-10-15 01:29:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5675. [2019-10-15 01:29:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5675 states. [2019-10-15 01:29:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 6664 transitions. [2019-10-15 01:29:02,274 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 6664 transitions. Word has length 211 [2019-10-15 01:29:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,275 INFO L462 AbstractCegarLoop]: Abstraction has 5675 states and 6664 transitions. [2019-10-15 01:29:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 6664 transitions. [2019-10-15 01:29:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-15 01:29:02,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,284 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, 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] [2019-10-15 01:29:02,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,488 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588841, now seen corresponding path program 1 times [2019-10-15 01:29:02,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540965346] [2019-10-15 01:29:02,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-15 01:29:02,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540965346] [2019-10-15 01:29:02,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726579873] [2019-10-15 01:29:02,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:02,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:29:02,961 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-15 01:29:03,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:03,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2019-10-15 01:29:03,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884122589] [2019-10-15 01:29:03,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:03,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:03,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:03,092 INFO L87 Difference]: Start difference. First operand 5675 states and 6664 transitions. Second operand 3 states. [2019-10-15 01:29:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,517 INFO L93 Difference]: Finished difference Result 15902 states and 19722 transitions. [2019-10-15 01:29:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:03,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-15 01:29:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,562 INFO L225 Difference]: With dead ends: 15902 [2019-10-15 01:29:03,563 INFO L226 Difference]: Without dead ends: 10249 [2019-10-15 01:29:03,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2019-10-15 01:29:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 10246. [2019-10-15 01:29:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10246 states. [2019-10-15 01:29:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 12529 transitions. [2019-10-15 01:29:04,496 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 12529 transitions. Word has length 212 [2019-10-15 01:29:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,496 INFO L462 AbstractCegarLoop]: Abstraction has 10246 states and 12529 transitions. [2019-10-15 01:29:04,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 12529 transitions. [2019-10-15 01:29:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:29:04,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,510 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, 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] [2019-10-15 01:29:04,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:04,714 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-10-15 01:29:04,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142494533] [2019-10-15 01:29:04,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-15 01:29:04,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142494533] [2019-10-15 01:29:04,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495563002] [2019-10-15 01:29:04,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true