java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:39,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:39,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:39,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:39,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:39,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:39,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:39,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:39,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:39,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:39,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:39,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:39,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:39,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:39,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:39,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:39,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:39,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:39,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:39,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:39,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:39,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:39,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:39,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:39,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:39,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:39,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:39,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:39,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:39,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:39,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:39,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:39,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:39,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:39,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:39,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:39,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:53:39,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:39,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:39,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:39,237 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:39,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:39,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:39,238 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:39,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:39,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:39,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:39,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:39,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:39,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:39,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:39,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:39,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:39,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:39,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:39,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:39,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:39,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:39,241 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:39,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:39,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:39,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:39,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:39,242 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:39,243 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:39,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:39,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:39,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:39,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:39,311 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:39,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label04_true-unreach-call.c [2018-10-24 14:53:39,373 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b3fa514ab/3e4ce9084c7b44e599d83cd2348a92c6/FLAG4d4ec05cd [2018-10-24 14:53:40,079 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:40,079 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label04_true-unreach-call.c [2018-10-24 14:53:40,102 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b3fa514ab/3e4ce9084c7b44e599d83cd2348a92c6/FLAG4d4ec05cd [2018-10-24 14:53:40,124 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b3fa514ab/3e4ce9084c7b44e599d83cd2348a92c6 [2018-10-24 14:53:40,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:40,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:40,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:40,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:40,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:40,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:40" (1/1) ... [2018-10-24 14:53:40,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a55a051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:40, skipping insertion in model container [2018-10-24 14:53:40,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:40" (1/1) ... [2018-10-24 14:53:40,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:40,264 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:41,004 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:41,009 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:41,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:41,362 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:41,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41 WrapperNode [2018-10-24 14:53:41,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:41,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:41,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:41,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:41,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:41,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:41,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:41,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:41,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... [2018-10-24 14:53:41,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:41,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:41,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:41,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:41,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:53:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:47,267 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:47,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:47 BoogieIcfgContainer [2018-10-24 14:53:47,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:47,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:47,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:47,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:47,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:40" (1/3) ... [2018-10-24 14:53:47,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdb355f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:47, skipping insertion in model container [2018-10-24 14:53:47,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:41" (2/3) ... [2018-10-24 14:53:47,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdb355f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:47, skipping insertion in model container [2018-10-24 14:53:47,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:47" (3/3) ... [2018-10-24 14:53:47,277 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label04_true-unreach-call.c [2018-10-24 14:53:47,288 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:47,304 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:47,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:47,371 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:47,372 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:47,372 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:47,372 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:47,372 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:47,373 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:47,373 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:47,373 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:47,373 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 14:53:47,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:47,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:47,421 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:47,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1635386790, now seen corresponding path program 1 times [2018-10-24 14:53:47,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:47,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:47,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:48,396 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:53:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:48,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:48,557 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:51,933 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:53:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:51,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-24 14:53:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:51,967 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:53:51,968 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:53:51,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:53:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:53:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:53:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:53:52,091 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 199 [2018-10-24 14:53:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:52,092 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:53:52,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:53:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 14:53:52,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:52,100 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:52,100 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:52,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash 618288763, now seen corresponding path program 1 times [2018-10-24 14:53:52,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:52,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:52,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:52,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:52,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:52,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:52,248 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:53:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:54,817 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:53:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:54,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-24 14:53:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:54,825 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:53:54,825 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:53:54,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:53:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:53:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:53:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:53:54,860 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 208 [2018-10-24 14:53:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:54,861 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:53:54,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:53:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 14:53:54,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:54,866 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:54,866 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:54,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1536268327, now seen corresponding path program 1 times [2018-10-24 14:53:54,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:54,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:53:55,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:55,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:55,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:55,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:55,169 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:53:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:59,109 INFO L93 Difference]: Finished difference Result 2685 states and 4406 transitions. [2018-10-24 14:53:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:59,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-10-24 14:53:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:59,122 INFO L225 Difference]: With dead ends: 2685 [2018-10-24 14:53:59,122 INFO L226 Difference]: Without dead ends: 1756 [2018-10-24 14:53:59,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2018-10-24 14:53:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1750. [2018-10-24 14:53:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-24 14:53:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2692 transitions. [2018-10-24 14:53:59,161 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2692 transitions. Word has length 216 [2018-10-24 14:53:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:59,162 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2692 transitions. [2018-10-24 14:53:59,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2692 transitions. [2018-10-24 14:53:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:53:59,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:59,168 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:59,169 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:59,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 755004321, now seen corresponding path program 1 times [2018-10-24 14:53:59,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:53:59,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:59,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:59,327 INFO L87 Difference]: Start difference. First operand 1750 states and 2692 transitions. Second operand 3 states. [2018-10-24 14:54:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:00,829 INFO L93 Difference]: Finished difference Result 5134 states and 7944 transitions. [2018-10-24 14:54:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:00,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-24 14:54:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:00,848 INFO L225 Difference]: With dead ends: 5134 [2018-10-24 14:54:00,848 INFO L226 Difference]: Without dead ends: 3386 [2018-10-24 14:54:00,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-24 14:54:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3384. [2018-10-24 14:54:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-10-24 14:54:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4656 transitions. [2018-10-24 14:54:00,967 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4656 transitions. Word has length 223 [2018-10-24 14:54:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:00,967 INFO L481 AbstractCegarLoop]: Abstraction has 3384 states and 4656 transitions. [2018-10-24 14:54:00,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4656 transitions. [2018-10-24 14:54:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:54:00,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:00,977 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:00,977 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:00,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1208871158, now seen corresponding path program 1 times [2018-10-24 14:54:00,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:00,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:00,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:01,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:01,173 INFO L87 Difference]: Start difference. First operand 3384 states and 4656 transitions. Second operand 4 states. [2018-10-24 14:54:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:03,770 INFO L93 Difference]: Finished difference Result 13341 states and 18403 transitions. [2018-10-24 14:54:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:03,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-10-24 14:54:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:03,810 INFO L225 Difference]: With dead ends: 13341 [2018-10-24 14:54:03,811 INFO L226 Difference]: Without dead ends: 9959 [2018-10-24 14:54:03,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2018-10-24 14:54:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 6652. [2018-10-24 14:54:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-24 14:54:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 8737 transitions. [2018-10-24 14:54:03,964 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 8737 transitions. Word has length 223 [2018-10-24 14:54:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:03,964 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 8737 transitions. [2018-10-24 14:54:03,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 8737 transitions. [2018-10-24 14:54:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-24 14:54:03,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:03,983 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:03,984 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:03,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -277600023, now seen corresponding path program 1 times [2018-10-24 14:54:03,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:54:04,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:04,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,183 INFO L87 Difference]: Start difference. First operand 6652 states and 8737 transitions. Second operand 3 states. [2018-10-24 14:54:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:04,958 INFO L93 Difference]: Finished difference Result 13270 states and 17429 transitions. [2018-10-24 14:54:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:04,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-24 14:54:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:04,985 INFO L225 Difference]: With dead ends: 13270 [2018-10-24 14:54:04,986 INFO L226 Difference]: Without dead ends: 6620 [2018-10-24 14:54:04,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-24 14:54:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-24 14:54:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-24 14:54:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8526 transitions. [2018-10-24 14:54:05,109 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8526 transitions. Word has length 237 [2018-10-24 14:54:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:05,109 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8526 transitions. [2018-10-24 14:54:05,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8526 transitions. [2018-10-24 14:54:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 14:54:05,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:05,126 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:05,126 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:05,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1510596309, now seen corresponding path program 1 times [2018-10-24 14:54:05,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:05,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:05,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:05,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:05,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:05,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:05,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:05,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:05,500 INFO L87 Difference]: Start difference. First operand 6620 states and 8526 transitions. Second operand 4 states. [2018-10-24 14:54:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:07,408 INFO L93 Difference]: Finished difference Result 16097 states and 21165 transitions. [2018-10-24 14:54:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:07,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-10-24 14:54:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:07,438 INFO L225 Difference]: With dead ends: 16097 [2018-10-24 14:54:07,438 INFO L226 Difference]: Without dead ends: 9479 [2018-10-24 14:54:07,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2018-10-24 14:54:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 9476. [2018-10-24 14:54:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-10-24 14:54:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11634 transitions. [2018-10-24 14:54:07,583 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11634 transitions. Word has length 264 [2018-10-24 14:54:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:07,583 INFO L481 AbstractCegarLoop]: Abstraction has 9476 states and 11634 transitions. [2018-10-24 14:54:07,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11634 transitions. [2018-10-24 14:54:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-24 14:54:07,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:07,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:07,603 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:07,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash 432220372, now seen corresponding path program 1 times [2018-10-24 14:54:07,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:07,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:07,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:07,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:07,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:07,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:07,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:07,959 INFO L87 Difference]: Start difference. First operand 9476 states and 11634 transitions. Second operand 4 states. [2018-10-24 14:54:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:09,968 INFO L93 Difference]: Finished difference Result 34296 states and 41507 transitions. [2018-10-24 14:54:09,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:09,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-10-24 14:54:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:10,011 INFO L225 Difference]: With dead ends: 34296 [2018-10-24 14:54:10,011 INFO L226 Difference]: Without dead ends: 24822 [2018-10-24 14:54:10,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24822 states. [2018-10-24 14:54:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24822 to 17840. [2018-10-24 14:54:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17840 states. [2018-10-24 14:54:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 21339 transitions. [2018-10-24 14:54:10,297 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 21339 transitions. Word has length 275 [2018-10-24 14:54:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:10,298 INFO L481 AbstractCegarLoop]: Abstraction has 17840 states and 21339 transitions. [2018-10-24 14:54:10,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 21339 transitions. [2018-10-24 14:54:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 14:54:10,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:10,322 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:10,322 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:10,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1169171758, now seen corresponding path program 1 times [2018-10-24 14:54:10,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:10,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:10,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:10,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:10,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:10,531 INFO L87 Difference]: Start difference. First operand 17840 states and 21339 transitions. Second operand 3 states. [2018-10-24 14:54:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:12,453 INFO L93 Difference]: Finished difference Result 35679 states and 42678 transitions. [2018-10-24 14:54:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:12,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2018-10-24 14:54:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:12,488 INFO L225 Difference]: With dead ends: 35679 [2018-10-24 14:54:12,488 INFO L226 Difference]: Without dead ends: 17841 [2018-10-24 14:54:12,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17841 states. [2018-10-24 14:54:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17841 to 17840. [2018-10-24 14:54:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17840 states. [2018-10-24 14:54:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 20556 transitions. [2018-10-24 14:54:12,733 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 20556 transitions. Word has length 290 [2018-10-24 14:54:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:12,733 INFO L481 AbstractCegarLoop]: Abstraction has 17840 states and 20556 transitions. [2018-10-24 14:54:12,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 20556 transitions. [2018-10-24 14:54:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-24 14:54:12,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,759 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:12,759 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1581482495, now seen corresponding path program 1 times [2018-10-24 14:54:12,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:13,309 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:54:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:54:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:13,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:13,379 INFO L87 Difference]: Start difference. First operand 17840 states and 20556 transitions. Second operand 5 states. [2018-10-24 14:54:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:15,565 INFO L93 Difference]: Finished difference Result 54724 states and 62701 transitions. [2018-10-24 14:54:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:15,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-10-24 14:54:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:15,607 INFO L225 Difference]: With dead ends: 54724 [2018-10-24 14:54:15,608 INFO L226 Difference]: Without dead ends: 36886 [2018-10-24 14:54:15,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36886 states. [2018-10-24 14:54:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36886 to 36881. [2018-10-24 14:54:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36881 states. [2018-10-24 14:54:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36881 states to 36881 states and 42094 transitions. [2018-10-24 14:54:16,058 INFO L78 Accepts]: Start accepts. Automaton has 36881 states and 42094 transitions. Word has length 300 [2018-10-24 14:54:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:16,058 INFO L481 AbstractCegarLoop]: Abstraction has 36881 states and 42094 transitions. [2018-10-24 14:54:16,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36881 states and 42094 transitions. [2018-10-24 14:54:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-24 14:54:16,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:16,082 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:16,083 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:16,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash -188463746, now seen corresponding path program 1 times [2018-10-24 14:54:16,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:54:16,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:16,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:16,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:16,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:16,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:16,344 INFO L87 Difference]: Start difference. First operand 36881 states and 42094 transitions. Second operand 4 states. [2018-10-24 14:54:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:17,845 INFO L93 Difference]: Finished difference Result 72530 states and 82825 transitions. [2018-10-24 14:54:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:17,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2018-10-24 14:54:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:17,879 INFO L225 Difference]: With dead ends: 72530 [2018-10-24 14:54:17,879 INFO L226 Difference]: Without dead ends: 35651 [2018-10-24 14:54:17,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35651 states. [2018-10-24 14:54:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35651 to 35651. [2018-10-24 14:54:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35651 states. [2018-10-24 14:54:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35651 states to 35651 states and 39211 transitions. [2018-10-24 14:54:18,302 INFO L78 Accepts]: Start accepts. Automaton has 35651 states and 39211 transitions. Word has length 301 [2018-10-24 14:54:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:18,303 INFO L481 AbstractCegarLoop]: Abstraction has 35651 states and 39211 transitions. [2018-10-24 14:54:18,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35651 states and 39211 transitions. [2018-10-24 14:54:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-24 14:54:18,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:18,316 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:18,316 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:18,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash -625600061, now seen corresponding path program 1 times [2018-10-24 14:54:18,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:54:18,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:18,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:18,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:18,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:18,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:18,680 INFO L87 Difference]: Start difference. First operand 35651 states and 39211 transitions. Second operand 4 states. [2018-10-24 14:54:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:21,076 INFO L93 Difference]: Finished difference Result 130528 states and 142960 transitions. [2018-10-24 14:54:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:21,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-10-24 14:54:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:21,158 INFO L225 Difference]: With dead ends: 130528 [2018-10-24 14:54:21,158 INFO L226 Difference]: Without dead ends: 94879 [2018-10-24 14:54:21,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94879 states. [2018-10-24 14:54:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94879 to 94875. [2018-10-24 14:54:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94875 states. [2018-10-24 14:54:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94875 states to 94875 states and 103608 transitions. [2018-10-24 14:54:22,428 INFO L78 Accepts]: Start accepts. Automaton has 94875 states and 103608 transitions. Word has length 303 [2018-10-24 14:54:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,429 INFO L481 AbstractCegarLoop]: Abstraction has 94875 states and 103608 transitions. [2018-10-24 14:54:22,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94875 states and 103608 transitions. [2018-10-24 14:54:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-24 14:54:22,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,444 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:22,445 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 89891661, now seen corresponding path program 1 times [2018-10-24 14:54:22,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 14:54:22,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:22,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:22,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:22,706 INFO L87 Difference]: Start difference. First operand 94875 states and 103608 transitions. Second operand 3 states. [2018-10-24 14:54:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:23,866 INFO L93 Difference]: Finished difference Result 189745 states and 207211 transitions. [2018-10-24 14:54:23,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:23,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-10-24 14:54:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:23,948 INFO L225 Difference]: With dead ends: 189745 [2018-10-24 14:54:23,948 INFO L226 Difference]: Without dead ends: 94872 [2018-10-24 14:54:23,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94872 states. [2018-10-24 14:54:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94872 to 94872. [2018-10-24 14:54:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94872 states. [2018-10-24 14:54:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94872 states to 94872 states and 103602 transitions. [2018-10-24 14:54:25,619 INFO L78 Accepts]: Start accepts. Automaton has 94872 states and 103602 transitions. Word has length 332 [2018-10-24 14:54:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:25,619 INFO L481 AbstractCegarLoop]: Abstraction has 94872 states and 103602 transitions. [2018-10-24 14:54:25,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 94872 states and 103602 transitions. [2018-10-24 14:54:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-24 14:54:25,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:25,639 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:25,640 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:25,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 608085876, now seen corresponding path program 1 times [2018-10-24 14:54:25,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 14:54:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:25,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:25,867 INFO L87 Difference]: Start difference. First operand 94872 states and 103602 transitions. Second operand 3 states. [2018-10-24 14:54:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:28,122 INFO L93 Difference]: Finished difference Result 236472 states and 257846 transitions. [2018-10-24 14:54:28,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:28,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-24 14:54:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:28,254 INFO L225 Difference]: With dead ends: 236472 [2018-10-24 14:54:28,254 INFO L226 Difference]: Without dead ends: 141602 [2018-10-24 14:54:28,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141602 states. [2018-10-24 14:54:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141602 to 138311. [2018-10-24 14:54:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138311 states. [2018-10-24 14:54:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138311 states to 138311 states and 150689 transitions. [2018-10-24 14:54:30,447 INFO L78 Accepts]: Start accepts. Automaton has 138311 states and 150689 transitions. Word has length 337 [2018-10-24 14:54:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:30,448 INFO L481 AbstractCegarLoop]: Abstraction has 138311 states and 150689 transitions. [2018-10-24 14:54:30,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 138311 states and 150689 transitions. [2018-10-24 14:54:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-24 14:54:30,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:30,468 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:30,469 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:30,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -645539913, now seen corresponding path program 1 times [2018-10-24 14:54:30,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:30,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:30,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:30,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:30,840 INFO L87 Difference]: Start difference. First operand 138311 states and 150689 transitions. Second operand 3 states. [2018-10-24 14:54:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:32,579 INFO L93 Difference]: Finished difference Result 264166 states and 288289 transitions. [2018-10-24 14:54:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:32,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-10-24 14:54:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:32,733 INFO L225 Difference]: With dead ends: 264166 [2018-10-24 14:54:32,733 INFO L226 Difference]: Without dead ends: 125857 [2018-10-24 14:54:32,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125857 states. [2018-10-24 14:54:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125857 to 125399. [2018-10-24 14:54:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125399 states. [2018-10-24 14:54:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125399 states to 125399 states and 135766 transitions. [2018-10-24 14:54:35,424 INFO L78 Accepts]: Start accepts. Automaton has 125399 states and 135766 transitions. Word has length 339 [2018-10-24 14:54:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:35,425 INFO L481 AbstractCegarLoop]: Abstraction has 125399 states and 135766 transitions. [2018-10-24 14:54:35,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 125399 states and 135766 transitions. [2018-10-24 14:54:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-24 14:54:35,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:35,451 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:35,451 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:35,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1762118887, now seen corresponding path program 1 times [2018-10-24 14:54:35,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:35,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 14:54:35,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:35,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:35,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:35,843 INFO L87 Difference]: Start difference. First operand 125399 states and 135766 transitions. Second operand 4 states. [2018-10-24 14:54:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:38,807 INFO L93 Difference]: Finished difference Result 254299 states and 275345 transitions. [2018-10-24 14:54:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:38,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-10-24 14:54:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:38,947 INFO L225 Difference]: With dead ends: 254299 [2018-10-24 14:54:38,948 INFO L226 Difference]: Without dead ends: 128902 [2018-10-24 14:54:39,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128902 states. [2018-10-24 14:54:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128902 to 127233. [2018-10-24 14:54:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127233 states. [2018-10-24 14:54:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127233 states to 127233 states and 137494 transitions. [2018-10-24 14:54:41,757 INFO L78 Accepts]: Start accepts. Automaton has 127233 states and 137494 transitions. Word has length 386 [2018-10-24 14:54:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:41,758 INFO L481 AbstractCegarLoop]: Abstraction has 127233 states and 137494 transitions. [2018-10-24 14:54:41,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 127233 states and 137494 transitions. [2018-10-24 14:54:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-24 14:54:41,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:41,804 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:41,804 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:41,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1892515548, now seen corresponding path program 1 times [2018-10-24 14:54:41,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:41,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:41,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:42,171 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:54:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 156 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-24 14:54:42,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:42,429 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:54:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:42,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-10-24 14:54:43,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:54:43,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:43,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:43,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:43,038 INFO L87 Difference]: Start difference. First operand 127233 states and 137494 transitions. Second operand 6 states. [2018-10-24 14:54:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:52,925 INFO L93 Difference]: Finished difference Result 629405 states and 681734 transitions. [2018-10-24 14:54:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:54:52,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 435 [2018-10-24 14:54:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:53,420 INFO L225 Difference]: With dead ends: 629405 [2018-10-24 14:54:53,420 INFO L226 Difference]: Without dead ends: 502174 [2018-10-24 14:54:53,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:54:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502174 states. [2018-10-24 14:54:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502174 to 490247. [2018-10-24 14:54:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490247 states. [2018-10-24 14:54:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490247 states to 490247 states and 522609 transitions. [2018-10-24 14:54:59,967 INFO L78 Accepts]: Start accepts. Automaton has 490247 states and 522609 transitions. Word has length 435 [2018-10-24 14:54:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:59,968 INFO L481 AbstractCegarLoop]: Abstraction has 490247 states and 522609 transitions. [2018-10-24 14:54:59,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 490247 states and 522609 transitions. [2018-10-24 14:55:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-24 14:55:00,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:00,010 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:55:00,010 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:00,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash 551573779, now seen corresponding path program 1 times [2018-10-24 14:55:00,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:00,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:00,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:55:00,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:00,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:00,375 INFO L87 Difference]: Start difference. First operand 490247 states and 522609 transitions. Second operand 3 states. [2018-10-24 14:55:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:07,323 INFO L93 Difference]: Finished difference Result 1266719 states and 1349191 transitions. [2018-10-24 14:55:07,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:07,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-10-24 14:55:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:08,190 INFO L225 Difference]: With dead ends: 1266719 [2018-10-24 14:55:08,190 INFO L226 Difference]: Without dead ends: 776474 [2018-10-24 14:55:08,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776474 states. [2018-10-24 14:55:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776474 to 729108. [2018-10-24 14:55:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729108 states. [2018-10-24 14:55:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729108 states to 729108 states and 775133 transitions. [2018-10-24 14:55:27,900 INFO L78 Accepts]: Start accepts. Automaton has 729108 states and 775133 transitions. Word has length 436 [2018-10-24 14:55:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:27,901 INFO L481 AbstractCegarLoop]: Abstraction has 729108 states and 775133 transitions. [2018-10-24 14:55:27,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 729108 states and 775133 transitions. [2018-10-24 14:55:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-24 14:55:27,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:27,946 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:55:27,946 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:27,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1478566449, now seen corresponding path program 1 times [2018-10-24 14:55:27,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:27,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:28,602 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-24 14:55:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 270 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:55:29,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:55:29,143 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:55:29,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:29,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:55:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-24 14:55:29,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:55:29,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:55:29,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:55:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:55:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:55:29,619 INFO L87 Difference]: Start difference. First operand 729108 states and 775133 transitions. Second operand 11 states. [2018-10-24 14:55:47,616 WARN L179 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 14:56:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:11,368 INFO L93 Difference]: Finished difference Result 2908895 states and 3096403 transitions. [2018-10-24 14:56:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 14:56:11,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 438 [2018-10-24 14:56:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:15,157 INFO L225 Difference]: With dead ends: 2908895 [2018-10-24 14:56:15,157 INFO L226 Difference]: Without dead ends: 2179777 [2018-10-24 14:56:15,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2018-10-24 14:56:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179777 states. [2018-10-24 14:56:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179777 to 2111682. [2018-10-24 14:56:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111682 states.