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 -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:08:37,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:37,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:37,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:37,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:37,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:37,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:37,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:37,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:37,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:37,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:37,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:37,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:37,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:37,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:37,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:37,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:37,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:37,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:37,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:37,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:37,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:37,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:37,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:37,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:37,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:37,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:37,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:37,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:37,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:37,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:37,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:37,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:37,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:37,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:37,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:37,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:37,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:37,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:37,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:37,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:37,152 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-09-20 13:08:37,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:37,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:37,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:37,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:37,168 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:37,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:37,169 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:37,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:37,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:37,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:37,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:37,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:37,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:37,170 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:37,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:37,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:37,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:37,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:37,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:37,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:37,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:37,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:37,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:37,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:37,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:37,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:37,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:37,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:37,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:37,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:37,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:37,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:37,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:37,217 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:37,218 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-09-20 13:08:37,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493833887/c88cabf8fc26485195e450a7fcca07c7/FLAG2b06e49be [2019-09-20 13:08:37,753 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:37,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-09-20 13:08:37,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493833887/c88cabf8fc26485195e450a7fcca07c7/FLAG2b06e49be [2019-09-20 13:08:38,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493833887/c88cabf8fc26485195e450a7fcca07c7 [2019-09-20 13:08:38,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:38,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:38,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:38,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:38,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:38,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbd8788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38, skipping insertion in model container [2019-09-20 13:08:38,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,130 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:38,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:38,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:38,399 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:38,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:38,556 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:38,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38 WrapperNode [2019-09-20 13:08:38,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:38,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:38,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:38,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:38,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... [2019-09-20 13:08:38,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:38,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:38,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:38,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:38,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:08:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:08:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:08:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-20 13:08:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:08:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:08:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-20 13:08:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:08:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:08:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:08:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:08:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:08:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:08:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:08:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:08:38,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:38,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:38,670 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:08:38,670 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:08:38,670 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:08:38,670 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-20 13:08:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:08:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:38,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:39,264 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:39,264 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-20 13:08:39,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:39 BoogieIcfgContainer [2019-09-20 13:08:39,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:39,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:39,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:39,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:39,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:38" (1/3) ... [2019-09-20 13:08:39,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c04d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:39, skipping insertion in model container [2019-09-20 13:08:39,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:38" (2/3) ... [2019-09-20 13:08:39,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c04d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:39, skipping insertion in model container [2019-09-20 13:08:39,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:39" (3/3) ... [2019-09-20 13:08:39,276 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-09-20 13:08:39,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:39,296 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:39,311 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:39,357 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:39,358 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:39,359 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:39,359 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:39,359 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:39,359 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:39,360 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:39,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:39,360 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-09-20 13:08:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:39,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:39,402 INFO L407 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-09-20 13:08:39,404 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-09-20 13:08:39,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:39,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:39,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:39,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:39,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:39,798 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-09-20 13:08:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:40,381 INFO L93 Difference]: Finished difference Result 361 states and 528 transitions. [2019-09-20 13:08:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:40,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-20 13:08:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:40,406 INFO L225 Difference]: With dead ends: 361 [2019-09-20 13:08:40,407 INFO L226 Difference]: Without dead ends: 195 [2019-09-20 13:08:40,419 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-20 13:08:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-09-20 13:08:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:08:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-09-20 13:08:40,552 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-09-20 13:08:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:40,553 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-09-20 13:08:40,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-09-20 13:08:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:40,568 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:40,571 INFO L407 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-09-20 13:08:40,571 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-09-20 13:08:40,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:40,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:40,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:40,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:40,726 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-09-20 13:08:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:41,159 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2019-09-20 13:08:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:41,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-20 13:08:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:41,163 INFO L225 Difference]: With dead ends: 338 [2019-09-20 13:08:41,164 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:08:41,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:08:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-09-20 13:08:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:08:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-09-20 13:08:41,214 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-09-20 13:08:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:41,214 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-09-20 13:08:41,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-09-20 13:08:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:41,222 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:41,223 INFO L407 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-09-20 13:08:41,223 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-09-20 13:08:41,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:41,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:41,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:41,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:41,385 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-09-20 13:08:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:41,768 INFO L93 Difference]: Finished difference Result 355 states and 496 transitions. [2019-09-20 13:08:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:41,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-20 13:08:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:41,771 INFO L225 Difference]: With dead ends: 355 [2019-09-20 13:08:41,771 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:08:41,772 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:08:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-09-20 13:08:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:08:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-09-20 13:08:41,795 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-09-20 13:08:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:41,795 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-09-20 13:08:41,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-09-20 13:08:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:41,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:41,797 INFO L407 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-09-20 13:08:41,797 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-09-20 13:08:41,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:41,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:41,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:41,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:41,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:41,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:41,870 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-09-20 13:08:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:42,247 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2019-09-20 13:08:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:42,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-20 13:08:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:42,250 INFO L225 Difference]: With dead ends: 349 [2019-09-20 13:08:42,250 INFO L226 Difference]: Without dead ends: 204 [2019-09-20 13:08:42,251 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-20 13:08:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-09-20 13:08:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:08:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-09-20 13:08:42,273 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-09-20 13:08:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:42,274 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-09-20 13:08:42,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-09-20 13:08:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:42,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:42,276 INFO L407 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-09-20 13:08:42,276 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-09-20 13:08:42,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:42,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:42,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:42,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:42,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:42,349 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-09-20 13:08:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:42,668 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2019-09-20 13:08:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:42,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-20 13:08:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:42,671 INFO L225 Difference]: With dead ends: 351 [2019-09-20 13:08:42,671 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:08:42,672 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:08:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-09-20 13:08:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:08:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-09-20 13:08:42,691 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-09-20 13:08:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:42,691 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-09-20 13:08:42,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-09-20 13:08:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:08:42,693 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:42,693 INFO L407 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-09-20 13:08:42,693 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-09-20 13:08:42,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:42,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:42,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:42,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:42,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:42,803 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-09-20 13:08:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,027 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2019-09-20 13:08:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:43,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-20 13:08:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,030 INFO L225 Difference]: With dead ends: 445 [2019-09-20 13:08:43,030 INFO L226 Difference]: Without dead ends: 301 [2019-09-20 13:08:43,031 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-20 13:08:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-09-20 13:08:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-20 13:08:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-09-20 13:08:43,061 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-09-20 13:08:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,061 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-09-20 13:08:43,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-09-20 13:08:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:08:43,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,064 INFO L407 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-09-20 13:08:43,064 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-09-20 13:08:43,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-20 13:08:43,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:43,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:08:43,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:08:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-20 13:08:43,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:08:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:08:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:43,332 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 7 states. [2019-09-20 13:08:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,482 INFO L93 Difference]: Finished difference Result 875 states and 1233 transitions. [2019-09-20 13:08:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:08:43,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-20 13:08:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,491 INFO L225 Difference]: With dead ends: 875 [2019-09-20 13:08:43,491 INFO L226 Difference]: Without dead ends: 596 [2019-09-20 13:08:43,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:08:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-20 13:08:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 587. [2019-09-20 13:08:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-20 13:08:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-09-20 13:08:43,580 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 145 [2019-09-20 13:08:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,581 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-09-20 13:08:43,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:08:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-09-20 13:08:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:08:43,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,585 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:43,585 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash -88135487, now seen corresponding path program 1 times [2019-09-20 13:08:43,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 13:08:43,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:43,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:43,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:43,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:43,679 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-09-20 13:08:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,837 INFO L93 Difference]: Finished difference Result 1147 states and 1563 transitions. [2019-09-20 13:08:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:43,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:08:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,842 INFO L225 Difference]: With dead ends: 1147 [2019-09-20 13:08:43,842 INFO L226 Difference]: Without dead ends: 581 [2019-09-20 13:08:43,845 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-20 13:08:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2019-09-20 13:08:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-09-20 13:08:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 789 transitions. [2019-09-20 13:08:43,896 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 789 transitions. Word has length 145 [2019-09-20 13:08:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,897 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 789 transitions. [2019-09-20 13:08:43,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 789 transitions. [2019-09-20 13:08:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-20 13:08:43,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,900 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:43,900 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash -819888643, now seen corresponding path program 1 times [2019-09-20 13:08:43,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-20 13:08:43,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:43,984 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:44,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:44,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:08:44,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-20 13:08:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:44,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-20 13:08:44,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:44,177 INFO L87 Difference]: Start difference. First operand 581 states and 789 transitions. Second operand 5 states. [2019-09-20 13:08:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:44,949 INFO L93 Difference]: Finished difference Result 2697 states and 4099 transitions. [2019-09-20 13:08:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:44,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-20 13:08:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:44,973 INFO L225 Difference]: With dead ends: 2697 [2019-09-20 13:08:44,974 INFO L226 Difference]: Without dead ends: 2137 [2019-09-20 13:08:44,979 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-09-20 13:08:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2114. [2019-09-20 13:08:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-09-20 13:08:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2975 transitions. [2019-09-20 13:08:45,216 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2975 transitions. Word has length 146 [2019-09-20 13:08:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:45,219 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 2975 transitions. [2019-09-20 13:08:45,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2975 transitions. [2019-09-20 13:08:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:08:45,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:45,235 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:45,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 242797264, now seen corresponding path program 1 times [2019-09-20 13:08:45,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:45,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:45,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:45,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:45,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-20 13:08:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:45,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:45,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:45,331 INFO L87 Difference]: Start difference. First operand 2114 states and 2975 transitions. Second operand 4 states. [2019-09-20 13:08:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:45,625 INFO L93 Difference]: Finished difference Result 3701 states and 5182 transitions. [2019-09-20 13:08:45,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:45,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-20 13:08:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:45,639 INFO L225 Difference]: With dead ends: 3701 [2019-09-20 13:08:45,639 INFO L226 Difference]: Without dead ends: 1608 [2019-09-20 13:08:45,648 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-09-20 13:08:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-09-20 13:08:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-09-20 13:08:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2233 transitions. [2019-09-20 13:08:45,777 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2233 transitions. Word has length 189 [2019-09-20 13:08:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:45,778 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2233 transitions. [2019-09-20 13:08:45,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2233 transitions. [2019-09-20 13:08:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:08:45,784 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:45,784 INFO L407 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-09-20 13:08:45,785 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -119316499, now seen corresponding path program 1 times [2019-09-20 13:08:45,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:45,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:08:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:45,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:45,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:45,889 INFO L87 Difference]: Start difference. First operand 1608 states and 2233 transitions. Second operand 5 states. [2019-09-20 13:08:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:46,572 INFO L93 Difference]: Finished difference Result 4152 states and 5894 transitions. [2019-09-20 13:08:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:46,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-20 13:08:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:46,596 INFO L225 Difference]: With dead ends: 4152 [2019-09-20 13:08:46,596 INFO L226 Difference]: Without dead ends: 2566 [2019-09-20 13:08:46,607 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-20 13:08:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2290. [2019-09-20 13:08:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-09-20 13:08:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3092 transitions. [2019-09-20 13:08:46,856 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3092 transitions. Word has length 189 [2019-09-20 13:08:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:46,857 INFO L475 AbstractCegarLoop]: Abstraction has 2290 states and 3092 transitions. [2019-09-20 13:08:46,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3092 transitions. [2019-09-20 13:08:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:08:46,866 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:46,866 INFO L407 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-09-20 13:08:46,867 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash -553822097, now seen corresponding path program 1 times [2019-09-20 13:08:46,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:46,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:46,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:08:46,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:46,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:46,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:46,982 INFO L87 Difference]: Start difference. First operand 2290 states and 3092 transitions. Second operand 5 states. [2019-09-20 13:08:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:47,484 INFO L93 Difference]: Finished difference Result 4556 states and 6200 transitions. [2019-09-20 13:08:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:47,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-20 13:08:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:47,506 INFO L225 Difference]: With dead ends: 4556 [2019-09-20 13:08:47,507 INFO L226 Difference]: Without dead ends: 2290 [2019-09-20 13:08:47,563 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-09-20 13:08:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2019-09-20 13:08:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-09-20 13:08:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3056 transitions. [2019-09-20 13:08:47,817 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3056 transitions. Word has length 189 [2019-09-20 13:08:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:47,818 INFO L475 AbstractCegarLoop]: Abstraction has 2290 states and 3056 transitions. [2019-09-20 13:08:47,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3056 transitions. [2019-09-20 13:08:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:08:47,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:47,832 INFO L407 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-09-20 13:08:47,832 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1260418703, now seen corresponding path program 1 times [2019-09-20 13:08:47,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:08:47,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:47,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:47,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:47,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:47,935 INFO L87 Difference]: Start difference. First operand 2290 states and 3056 transitions. Second operand 5 states. [2019-09-20 13:08:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:48,561 INFO L93 Difference]: Finished difference Result 5038 states and 7256 transitions. [2019-09-20 13:08:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:48,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-20 13:08:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:48,580 INFO L225 Difference]: With dead ends: 5038 [2019-09-20 13:08:48,580 INFO L226 Difference]: Without dead ends: 2772 [2019-09-20 13:08:48,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-09-20 13:08:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2568. [2019-09-20 13:08:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-09-20 13:08:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3344 transitions. [2019-09-20 13:08:48,831 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3344 transitions. Word has length 189 [2019-09-20 13:08:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:48,831 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3344 transitions. [2019-09-20 13:08:48,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3344 transitions. [2019-09-20 13:08:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-20 13:08:48,839 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:48,840 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:48,840 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1325606160, now seen corresponding path program 1 times [2019-09-20 13:08:48,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:48,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:48,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:08:48,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:48,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:48,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:48,924 INFO L87 Difference]: Start difference. First operand 2568 states and 3344 transitions. Second operand 5 states. [2019-09-20 13:08:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:49,546 INFO L93 Difference]: Finished difference Result 5441 states and 7408 transitions. [2019-09-20 13:08:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:49,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-09-20 13:08:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:49,572 INFO L225 Difference]: With dead ends: 5441 [2019-09-20 13:08:49,572 INFO L226 Difference]: Without dead ends: 2895 [2019-09-20 13:08:49,585 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-09-20 13:08:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2825. [2019-09-20 13:08:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-09-20 13:08:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3566 transitions. [2019-09-20 13:08:49,852 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3566 transitions. Word has length 190 [2019-09-20 13:08:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:49,852 INFO L475 AbstractCegarLoop]: Abstraction has 2825 states and 3566 transitions. [2019-09-20 13:08:49,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3566 transitions. [2019-09-20 13:08:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-20 13:08:49,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:49,861 INFO L407 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, 1] [2019-09-20 13:08:49,861 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1858380762, now seen corresponding path program 1 times [2019-09-20 13:08:49,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:49,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:49,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-20 13:08:49,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:49,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:49,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:49,945 INFO L87 Difference]: Start difference. First operand 2825 states and 3566 transitions. Second operand 5 states. [2019-09-20 13:08:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:50,582 INFO L93 Difference]: Finished difference Result 6327 states and 8919 transitions. [2019-09-20 13:08:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:50,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-09-20 13:08:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:50,606 INFO L225 Difference]: With dead ends: 6327 [2019-09-20 13:08:50,606 INFO L226 Difference]: Without dead ends: 3526 [2019-09-20 13:08:50,621 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2019-09-20 13:08:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3107. [2019-09-20 13:08:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-09-20 13:08:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 3874 transitions. [2019-09-20 13:08:50,921 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 3874 transitions. Word has length 191 [2019-09-20 13:08:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:50,922 INFO L475 AbstractCegarLoop]: Abstraction has 3107 states and 3874 transitions. [2019-09-20 13:08:50,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3874 transitions. [2019-09-20 13:08:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-20 13:08:50,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:50,932 INFO L407 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:50,932 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 555577967, now seen corresponding path program 1 times [2019-09-20 13:08:50,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:50,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-09-20 13:08:51,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:51,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:08:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:51,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:08:51,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-20 13:08:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-20 13:08:51,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:51,252 INFO L87 Difference]: Start difference. First operand 3107 states and 3874 transitions. Second operand 3 states. [2019-09-20 13:08:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:51,465 INFO L93 Difference]: Finished difference Result 6630 states and 8367 transitions. [2019-09-20 13:08:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:51,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-20 13:08:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:51,486 INFO L225 Difference]: With dead ends: 6630 [2019-09-20 13:08:51,486 INFO L226 Difference]: Without dead ends: 3547 [2019-09-20 13:08:51,500 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2019-09-20 13:08:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3183. [2019-09-20 13:08:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-09-20 13:08:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3914 transitions. [2019-09-20 13:08:51,822 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3914 transitions. Word has length 246 [2019-09-20 13:08:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:51,824 INFO L475 AbstractCegarLoop]: Abstraction has 3183 states and 3914 transitions. [2019-09-20 13:08:51,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3914 transitions. [2019-09-20 13:08:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-20 13:08:51,832 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:51,833 INFO L407 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, 1] [2019-09-20 13:08:51,833 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1029239138, now seen corresponding path program 1 times [2019-09-20 13:08:51,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-20 13:08:51,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:51,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:08:52,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:08:52,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:52,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-20 13:08:52,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:08:52,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:08:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:52,075 INFO L87 Difference]: Start difference. First operand 3183 states and 3914 transitions. Second operand 7 states. [2019-09-20 13:08:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:52,355 INFO L93 Difference]: Finished difference Result 5740 states and 7214 transitions. [2019-09-20 13:08:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:08:52,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-09-20 13:08:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:52,382 INFO L225 Difference]: With dead ends: 5740 [2019-09-20 13:08:52,383 INFO L226 Difference]: Without dead ends: 2579 [2019-09-20 13:08:52,395 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:08:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2019-09-20 13:08:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2521. [2019-09-20 13:08:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-20 13:08:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 2975 transitions. [2019-09-20 13:08:52,572 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 2975 transitions. Word has length 191 [2019-09-20 13:08:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:52,573 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 2975 transitions. [2019-09-20 13:08:52,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:08:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 2975 transitions. [2019-09-20 13:08:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-20 13:08:52,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:52,583 INFO L407 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-09-20 13:08:52,583 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588841, now seen corresponding path program 1 times [2019-09-20 13:08:52,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:08:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:52,658 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:52,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:52,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:08:52,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:08:52,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-20 13:08:52,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:52,938 INFO L87 Difference]: Start difference. First operand 2521 states and 2975 transitions. Second operand 3 states. [2019-09-20 13:08:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:53,467 INFO L93 Difference]: Finished difference Result 7184 states and 8862 transitions. [2019-09-20 13:08:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:53,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-20 13:08:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:53,501 INFO L225 Difference]: With dead ends: 7184 [2019-09-20 13:08:53,502 INFO L226 Difference]: Without dead ends: 4687 [2019-09-20 13:08:53,515 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-09-20 13:08:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4680. [2019-09-20 13:08:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-20 13:08:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5738 transitions. [2019-09-20 13:08:54,008 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5738 transitions. Word has length 212 [2019-09-20 13:08:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:54,009 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5738 transitions. [2019-09-20 13:08:54,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5738 transitions. [2019-09-20 13:08:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-20 13:08:54,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:54,023 INFO L407 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-09-20 13:08:54,023 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-09-20 13:08:54,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:54,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-20 13:08:54,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:54,119 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:08:54,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-20 13:08:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:54,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-09-20 13:08:54,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:54,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:54,373 INFO L87 Difference]: Start difference. First operand 4680 states and 5738 transitions. Second operand 6 states. [2019-09-20 13:08:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:54,795 INFO L93 Difference]: Finished difference Result 8511 states and 10757 transitions. [2019-09-20 13:08:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:54,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-20 13:08:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:54,826 INFO L225 Difference]: With dead ends: 8511 [2019-09-20 13:08:54,826 INFO L226 Difference]: Without dead ends: 3853 [2019-09-20 13:08:54,844 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-09-20 13:08:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2019-09-20 13:08:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-09-20 13:08:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4578 transitions. [2019-09-20 13:08:55,330 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4578 transitions. Word has length 213 [2019-09-20 13:08:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,331 INFO L475 AbstractCegarLoop]: Abstraction has 3853 states and 4578 transitions. [2019-09-20 13:08:55,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4578 transitions. [2019-09-20 13:08:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-20 13:08:55,355 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,356 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:55,356 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1933955615, now seen corresponding path program 1 times [2019-09-20 13:08:55,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 40 proven. 32 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2019-09-20 13:08:55,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:55,647 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:08:55,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:08:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:08:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:55,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-20 13:08:55,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:08:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:08:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:08:56,000 INFO L87 Difference]: Start difference. First operand 3853 states and 4578 transitions. Second operand 9 states. [2019-09-20 13:08:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,493 INFO L93 Difference]: Finished difference Result 6506 states and 8066 transitions. [2019-09-20 13:08:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:08:56,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 367 [2019-09-20 13:08:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,526 INFO L225 Difference]: With dead ends: 6506 [2019-09-20 13:08:56,527 INFO L226 Difference]: Without dead ends: 2677 [2019-09-20 13:08:56,545 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:08:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2019-09-20 13:08:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2474. [2019-09-20 13:08:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-09-20 13:08:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 2806 transitions. [2019-09-20 13:08:56,881 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 2806 transitions. Word has length 367 [2019-09-20 13:08:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,882 INFO L475 AbstractCegarLoop]: Abstraction has 2474 states and 2806 transitions. [2019-09-20 13:08:56,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:08:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 2806 transitions. [2019-09-20 13:08:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-20 13:08:56,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,895 INFO L407 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:56,895 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2119960705, now seen corresponding path program 1 times [2019-09-20 13:08:56,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-20 13:08:57,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:57,030 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:08:57,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:08:57,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-09-20 13:08:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:57,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-20 13:08:57,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:57,375 INFO L87 Difference]: Start difference. First operand 2474 states and 2806 transitions. Second operand 5 states. [2019-09-20 13:08:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:57,765 INFO L93 Difference]: Finished difference Result 4608 states and 5222 transitions. [2019-09-20 13:08:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:57,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-09-20 13:08:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,781 INFO L225 Difference]: With dead ends: 4608 [2019-09-20 13:08:57,781 INFO L226 Difference]: Without dead ends: 2424 [2019-09-20 13:08:57,787 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-09-20 13:08:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2416. [2019-09-20 13:08:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-09-20 13:08:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2721 transitions. [2019-09-20 13:08:58,067 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2721 transitions. Word has length 259 [2019-09-20 13:08:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:58,068 INFO L475 AbstractCegarLoop]: Abstraction has 2416 states and 2721 transitions. [2019-09-20 13:08:58,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2721 transitions. [2019-09-20 13:08:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-20 13:08:58,078 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:58,078 INFO L407 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:58,079 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402789, now seen corresponding path program 1 times [2019-09-20 13:08:58,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:58,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-20 13:08:58,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:58,203 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:08:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:08:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-20 13:08:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-20 13:08:58,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:08:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:08:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:58,486 INFO L87 Difference]: Start difference. First operand 2416 states and 2721 transitions. Second operand 7 states. [2019-09-20 13:08:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:59,182 INFO L93 Difference]: Finished difference Result 3439 states and 3931 transitions. [2019-09-20 13:08:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:08:59,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2019-09-20 13:08:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:59,189 INFO L225 Difference]: With dead ends: 3439 [2019-09-20 13:08:59,189 INFO L226 Difference]: Without dead ends: 676 [2019-09-20 13:08:59,195 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:08:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-20 13:08:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 646. [2019-09-20 13:08:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-20 13:08:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 696 transitions. [2019-09-20 13:08:59,259 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 696 transitions. Word has length 264 [2019-09-20 13:08:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:59,260 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 696 transitions. [2019-09-20 13:08:59,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:08:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 696 transitions. [2019-09-20 13:08:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-20 13:08:59,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:59,264 INFO L407 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:59,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2108904620, now seen corresponding path program 1 times [2019-09-20 13:08:59,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:59,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-20 13:08:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:08:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:08:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:08:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:59,550 INFO L87 Difference]: Start difference. First operand 646 states and 696 transitions. Second operand 7 states. [2019-09-20 13:09:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:00,490 INFO L93 Difference]: Finished difference Result 660 states and 713 transitions. [2019-09-20 13:09:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:09:00,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-09-20 13:09:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:00,493 INFO L225 Difference]: With dead ends: 660 [2019-09-20 13:09:00,493 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:09:00,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:09:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:09:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:09:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:09:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:09:00,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-09-20 13:09:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:00,500 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:09:00,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:09:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:09:00,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:09:00,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:09:00,721 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-09-20 13:09:01,300 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-09-20 13:09:03,803 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 118 [2019-09-20 13:09:05,775 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 144 [2019-09-20 13:09:05,913 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 164