java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:28:51,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:28:51,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:28:51,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:28:51,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:28:51,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:28:51,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:28:51,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:28:51,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:28:51,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:28:51,355 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:28:51,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:28:51,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:28:51,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:28:51,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:28:51,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:28:51,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:28:51,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:28:51,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:28:51,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:28:51,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:28:51,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:28:51,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:28:51,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:28:51,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:28:51,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:28:51,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:28:51,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:28:51,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:28:51,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:28:51,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:28:51,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:28:51,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:28:51,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:28:51,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:28:51,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:28:51,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:28:51,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:28:51,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:28:51,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:28:51,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:28:51,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:28:51,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:28:51,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:28:51,450 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:28:51,451 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:28:51,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-08-04 21:28:51,452 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-08-04 21:28:51,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:28:51,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:28:51,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:28:51,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:28:51,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:28:51,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:28:51,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:28:51,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:28:51,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:28:51,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... [2019-08-04 21:28:51,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:28:51,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:28:51,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:28:51,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:28:51,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:28:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:28:51,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:28:51,870 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:28:51,870 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-04 21:28:51,872 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:28:51 BoogieIcfgContainer [2019-08-04 21:28:51,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:28:51,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:28:51,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:28:51,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:28:51,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:28:51" (1/2) ... [2019-08-04 21:28:51,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344f8d4 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:28:51, skipping insertion in model container [2019-08-04 21:28:51,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:28:51" (2/2) ... [2019-08-04 21:28:51,880 INFO L109 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-08-04 21:28:51,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:28:51,897 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:28:51,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:28:51,939 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:28:51,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:28:51,940 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:28:51,940 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:28:51,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:28:51,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:28:51,940 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:28:51,941 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:28:51,941 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:28:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:28:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:28:51,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:51,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:28:51,964 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-08-04 21:28:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:52,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:28:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:28:52,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:28:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:28:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:28:52,117 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-04 21:28:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:52,224 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-04 21:28:52,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:28:52,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:28:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:52,241 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:28:52,241 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:28:52,244 INFO L628 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 [2019-08-04 21:28:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:28:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:28:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:28:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-04 21:28:52,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-04 21:28:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:52,280 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-04 21:28:52,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:28:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-04 21:28:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:28:52,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:52,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:28:52,282 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-08-04 21:28:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-04 21:28:52,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:52,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:28:52,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:28:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:28:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:28:52,405 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-04 21:28:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:52,462 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-04 21:28:52,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:28:52,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-04 21:28:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:52,463 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:28:52,463 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:28:52,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:28:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:28:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:28:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:28:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-04 21:28:52,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-04 21:28:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:52,469 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-04 21:28:52,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:28:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-04 21:28:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:28:52,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:52,470 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-04 21:28:52,470 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-08-04 21:28:52,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:28:52,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:52,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:28:52,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:28:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:28:52,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:28:52,571 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-04 21:28:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:52,639 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-04 21:28:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:28:52,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-04 21:28:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:52,640 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:28:52,640 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:28:52,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:28:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:28:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:28:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:28:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-04 21:28:52,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-04 21:28:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:52,644 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-04 21:28:52,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:28:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-04 21:28:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:28:52,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:52,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-04 21:28:52,645 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-08-04 21:28:52,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-04 21:28:52,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:52,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:28:52,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:28:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:28:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:28:52,795 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-04 21:28:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:52,897 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-04 21:28:52,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:28:52,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:28:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:52,899 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:28:52,899 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:28:52,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:28:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:28:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:28:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:28:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-04 21:28:52,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-04 21:28:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:52,904 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-04 21:28:52,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:28:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-04 21:28:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:28:52,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:52,906 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-04 21:28:52,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-08-04 21:28:52,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-04 21:28:53,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:53,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:28:53,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:28:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:28:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:28:53,177 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-04 21:28:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:53,224 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-04 21:28:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:28:53,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-04 21:28:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:53,226 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:28:53,228 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:28:53,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:28:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:28:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:28:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:28:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-04 21:28:53,233 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-04 21:28:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:53,233 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-04 21:28:53,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:28:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-04 21:28:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:28:53,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:53,234 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-04 21:28:53,235 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:53,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-08-04 21:28:53,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:53,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:28:53,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-04 21:28:53,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:53,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:28:53,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:28:53,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:28:53,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:28:53,427 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-04 21:28:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:53,558 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-04 21:28:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:28:53,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-04 21:28:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:53,559 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:28:53,560 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:28:53,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:28:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:28:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:28:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:28:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-04 21:28:53,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-04 21:28:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:53,564 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-04 21:28:53,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:28:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-04 21:28:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:28:53,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:53,565 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-04 21:28:53,566 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-08-04 21:28:53,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:53,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:28:53,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-04 21:28:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:53,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:28:53,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:28:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:28:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:28:53,737 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-04 21:28:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:53,804 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-04 21:28:53,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:28:53,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-04 21:28:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:53,807 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:28:53,808 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:28:53,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:28:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:28:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:28:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:28:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-04 21:28:53,813 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-04 21:28:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:53,813 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-04 21:28:53,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:28:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-04 21:28:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:28:53,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:53,814 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-04 21:28:53,814 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-08-04 21:28:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:53,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:28:53,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-04 21:28:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:54,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:28:54,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:28:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:28:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:28:54,232 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-04 21:28:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:54,276 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-04 21:28:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:28:54,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-04 21:28:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:54,278 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:28:54,278 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:28:54,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:28:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:28:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:28:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:28:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-04 21:28:54,283 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-04 21:28:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:54,284 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-04 21:28:54,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:28:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-04 21:28:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:28:54,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:54,285 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-04 21:28:54,285 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:54,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-08-04 21:28:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:54,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:28:54,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-04 21:28:54,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:54,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:28:54,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:28:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:28:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:28:54,451 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-04 21:28:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:54,588 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-04 21:28:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:28:54,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-04 21:28:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:54,590 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:28:54,590 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:28:54,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:28:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:28:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:28:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:28:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-04 21:28:54,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-04 21:28:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:54,595 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-04 21:28:54,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:28:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-04 21:28:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:28:54,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:54,596 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-04 21:28:54,597 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-08-04 21:28:54,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:54,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:28:54,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-04 21:28:54,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:54,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:28:54,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:28:54,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:28:54,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:28:54,904 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-04 21:28:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:54,981 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-04 21:28:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:28:54,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-04 21:28:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:54,984 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:28:54,985 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:28:54,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:28:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:28:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:28:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:28:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-04 21:28:54,988 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-04 21:28:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:54,988 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-04 21:28:54,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:28:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-04 21:28:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:28:54,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:54,989 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-04 21:28:54,989 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-08-04 21:28:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:55,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:28:55,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-04 21:28:55,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:55,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:28:55,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:28:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:28:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:28:55,330 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-04 21:28:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:55,655 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-04 21:28:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:28:55,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-04 21:28:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:55,656 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:28:55,656 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:28:55,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:28:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:28:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:28:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:28:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-04 21:28:55,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-04 21:28:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:55,662 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-04 21:28:55,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:28:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-04 21:28:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:28:55,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:55,663 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-08-04 21:28:55,663 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-08-04 21:28:55,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:55,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:28:55,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-04 21:28:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:28:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:28:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:28:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:28:55,887 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-04 21:28:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:55,969 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-04 21:28:55,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:28:55,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-04 21:28:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:55,972 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:28:55,972 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:28:55,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:28:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:28:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:28:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:28:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-04 21:28:55,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-04 21:28:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:55,976 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-04 21:28:55,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:28:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-04 21:28:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:28:55,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:55,977 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-08-04 21:28:55,978 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-08-04 21:28:55,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:56,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:28:56,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-04 21:28:56,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:56,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:28:56,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:28:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:28:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:28:56,179 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-04 21:28:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:56,290 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-04 21:28:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:28:56,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-04 21:28:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:56,291 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:28:56,291 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:28:56,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:28:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:28:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:28:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:28:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-04 21:28:56,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-08-04 21:28:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:56,296 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-04 21:28:56,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:28:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-04 21:28:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:28:56,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:56,297 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-08-04 21:28:56,298 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-08-04 21:28:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:56,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:28:56,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-04 21:28:56,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:56,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:28:56,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:28:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:28:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:28:56,543 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-04 21:28:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:56,606 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-04 21:28:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:28:56,607 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-04 21:28:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:56,608 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:28:56,608 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:28:56,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:28:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:28:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:28:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:28:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-04 21:28:56,614 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-04 21:28:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:56,614 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-04 21:28:56,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:28:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-04 21:28:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:28:56,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:56,615 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-08-04 21:28:56,616 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-08-04 21:28:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:56,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:28:56,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-08-04 21:28:56,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:56,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:28:56,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:28:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:28:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:28:56,951 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-04 21:28:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:57,015 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-04 21:28:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:28:57,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-04 21:28:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:57,016 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:28:57,016 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:28:57,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:28:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:28:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:28:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:28:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-04 21:28:57,021 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-04 21:28:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:57,022 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-04 21:28:57,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:28:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-04 21:28:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:28:57,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:57,023 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-08-04 21:28:57,023 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-08-04 21:28:57,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:57,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:28:57,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-04 21:28:57,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:57,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:28:57,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:28:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:28:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:28:57,723 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-04 21:28:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:57,839 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-04 21:28:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:28:57,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-04 21:28:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:57,841 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:28:57,841 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:28:57,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:28:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:28:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:28:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:28:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-04 21:28:57,847 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-04 21:28:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:57,847 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-04 21:28:57,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:28:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-04 21:28:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:28:57,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:57,848 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-08-04 21:28:57,848 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-08-04 21:28:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:57,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:28:57,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-04 21:28:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:28:58,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:28:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:28:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:28:58,231 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-04 21:28:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:58,298 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-04 21:28:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:28:58,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-04 21:28:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:58,300 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:28:58,300 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:28:58,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:28:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:28:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:28:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:28:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-04 21:28:58,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-04 21:28:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:58,305 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-04 21:28:58,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:28:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-04 21:28:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:28:58,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:58,306 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-08-04 21:28:58,306 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-08-04 21:28:58,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:58,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:28:58,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-04 21:28:58,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:58,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:28:58,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:28:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:28:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:28:58,888 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-04 21:28:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:58,967 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-04 21:28:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:28:58,968 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-04 21:28:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:58,969 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:28:58,969 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:28:58,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:28:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:28:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:28:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:28:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-04 21:28:58,974 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-08-04 21:28:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:58,974 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-04 21:28:58,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:28:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-04 21:28:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:28:58,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:58,976 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-08-04 21:28:58,976 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-08-04 21:28:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:58,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:28:58,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-04 21:28:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:59,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:28:59,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:28:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:28:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:28:59,322 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-04 21:28:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:59,496 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-04 21:28:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:28:59,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-04 21:28:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:59,497 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:28:59,497 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:28:59,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:28:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:28:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:28:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:28:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-04 21:28:59,502 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-04 21:28:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:59,502 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-04 21:28:59,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:28:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-04 21:28:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:28:59,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:59,503 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-08-04 21:28:59,503 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-08-04 21:28:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:59,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:28:59,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-08-04 21:28:59,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:59,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:28:59,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:28:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:28:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:28:59,852 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-04 21:28:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:59,970 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-04 21:28:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:28:59,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-04 21:28:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:59,971 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:28:59,972 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:28:59,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:28:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:28:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:28:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:28:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-04 21:28:59,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-04 21:28:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:59,977 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-04 21:28:59,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:28:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-04 21:28:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:28:59,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:59,978 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-08-04 21:28:59,978 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-08-04 21:28:59,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:59,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:29:00,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-04 21:29:01,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:01,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:29:01,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:29:01,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:29:01,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:29:01,066 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-04 21:29:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:01,143 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-04 21:29:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:29:01,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-04 21:29:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:01,145 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:29:01,145 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:29:01,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:29:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:29:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:29:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:29:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-04 21:29:01,149 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-08-04 21:29:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:01,150 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-04 21:29:01,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:29:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-04 21:29:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:29:01,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:01,151 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-08-04 21:29:01,151 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-08-04 21:29:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:01,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:29:01,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-08-04 21:29:01,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:01,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:29:01,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:29:01,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:29:01,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:29:01,512 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-04 21:29:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:01,691 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-04 21:29:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:29:01,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-04 21:29:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:01,694 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:29:01,695 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:29:01,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:29:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:29:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:29:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:29:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-04 21:29:01,698 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-08-04 21:29:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:01,699 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-04 21:29:01,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:29:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-04 21:29:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:29:01,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:01,700 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-08-04 21:29:01,700 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-08-04 21:29:01,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:29:01,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-08-04 21:29:02,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:02,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:29:02,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:29:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:29:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:29:02,112 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-04 21:29:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:02,192 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-04 21:29:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:29:02,197 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-04 21:29:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:02,197 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:29:02,197 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:29:02,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:29:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:29:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:29:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:29:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-04 21:29:02,200 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-04 21:29:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:02,201 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-04 21:29:02,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:29:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-04 21:29:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:29:02,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:02,202 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-08-04 21:29:02,202 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-08-04 21:29:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:02,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:29:02,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-08-04 21:29:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:02,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:29:02,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:29:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:29:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:29:02,612 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-04 21:29:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:02,699 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-04 21:29:02,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:29:02,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-04 21:29:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:02,700 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:29:02,700 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:29:02,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:29:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:29:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:29:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:29:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-04 21:29:02,703 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-04 21:29:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:02,703 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-04 21:29:02,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:29:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-04 21:29:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:29:02,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:02,704 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-08-04 21:29:02,704 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-08-04 21:29:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:02,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:29:02,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-08-04 21:29:03,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:03,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:29:03,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:29:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:29:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:29:03,376 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-04 21:29:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:03,487 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-04 21:29:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:29:03,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-04 21:29:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:03,489 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:29:03,489 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:29:03,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:29:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:29:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:29:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:29:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-04 21:29:03,493 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-08-04 21:29:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:03,493 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-04 21:29:03,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:29:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-04 21:29:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:29:03,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:03,494 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-08-04 21:29:03,494 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-08-04 21:29:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:03,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:29:03,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-08-04 21:29:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:29:04,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:29:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:29:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:29:04,068 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-04 21:29:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:04,154 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-04 21:29:04,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:29:04,155 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-04 21:29:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:04,156 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:29:04,156 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:29:04,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:29:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:29:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:29:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:29:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-04 21:29:04,160 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-04 21:29:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:04,160 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-04 21:29:04,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:29:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-04 21:29:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:29:04,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:04,161 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-08-04 21:29:04,162 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-08-04 21:29:04,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:04,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:29:04,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-08-04 21:29:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:05,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:29:05,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:29:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:29:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:29:05,104 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-04 21:29:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:05,275 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-04 21:29:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:29:05,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-04 21:29:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:05,276 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:29:05,276 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:29:05,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:29:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:29:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:29:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:29:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-04 21:29:05,282 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-04 21:29:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:05,282 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-04 21:29:05,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:29:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-04 21:29:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:29:05,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:05,283 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-08-04 21:29:05,283 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-08-04 21:29:05,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:05,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:29:05,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-08-04 21:29:05,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:05,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:29:05,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:29:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:29:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:29:05,753 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-04 21:29:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:05,911 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-04 21:29:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:29:05,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-04 21:29:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:05,912 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:29:05,912 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:29:05,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:29:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:29:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:29:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:29:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-04 21:29:05,916 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-04 21:29:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:05,916 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-04 21:29:05,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:29:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-04 21:29:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:29:05,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:05,917 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-08-04 21:29:05,917 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:05,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-08-04 21:29:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:05,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:29:05,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-08-04 21:29:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:06,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:29:06,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:29:06,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:29:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:29:06,382 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-04 21:29:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:06,504 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-04 21:29:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:29:06,505 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-04 21:29:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:06,505 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:29:06,506 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:29:06,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:29:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:29:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:29:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:29:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-04 21:29:06,509 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-04 21:29:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:06,509 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-04 21:29:06,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:29:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-04 21:29:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:29:06,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:06,510 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-08-04 21:29:06,510 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-08-04 21:29:06,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:06,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:29:06,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-08-04 21:29:06,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:06,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:29:06,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:29:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:29:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:29:06,971 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-04 21:29:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:07,074 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-04 21:29:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:29:07,075 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-04 21:29:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:07,076 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:29:07,076 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:29:07,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:29:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:29:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:29:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:29:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-04 21:29:07,080 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-08-04 21:29:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:07,080 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-04 21:29:07,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:29:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-04 21:29:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:29:07,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:07,081 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-08-04 21:29:07,081 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-08-04 21:29:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:07,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:29:07,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-08-04 21:29:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:29:07,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:29:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:29:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:29:07,528 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-04 21:29:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:07,683 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-04 21:29:07,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:29:07,684 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-04 21:29:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:07,685 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:29:07,685 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:29:07,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:29:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:29:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:29:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:29:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-04 21:29:07,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-04 21:29:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:07,689 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-04 21:29:07,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:29:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-04 21:29:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:29:07,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:07,690 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-08-04 21:29:07,690 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-08-04 21:29:07,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:07,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:29:07,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-08-04 21:29:08,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:08,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:29:08,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:29:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:29:08,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:29:08,646 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-04 21:29:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:08,754 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-04 21:29:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:29:08,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-04 21:29:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:08,759 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:29:08,759 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:29:08,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:29:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:29:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:29:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:29:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-04 21:29:08,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-04 21:29:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:08,762 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-04 21:29:08,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:29:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-04 21:29:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:29:08,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:08,763 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-08-04 21:29:08,763 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-08-04 21:29:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:08,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:29:08,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-08-04 21:29:09,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:09,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:29:09,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:29:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:29:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:29:09,360 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-04 21:29:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:09,497 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-04 21:29:09,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:29:09,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-04 21:29:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:09,498 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:29:09,498 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:29:09,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:29:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:29:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:29:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:29:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-04 21:29:09,503 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-08-04 21:29:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:09,503 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-04 21:29:09,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:29:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-04 21:29:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:29:09,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:09,504 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-08-04 21:29:09,504 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-08-04 21:29:09,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:09,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:29:09,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-08-04 21:29:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:10,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:29:10,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:29:10,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:29:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:29:10,102 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-04 21:29:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:10,224 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-04 21:29:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:29:10,225 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-04 21:29:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:10,226 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:29:10,226 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:29:10,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:29:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:29:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:29:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:29:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-04 21:29:10,230 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-08-04 21:29:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:10,230 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-04 21:29:10,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:29:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-04 21:29:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:29:10,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:10,231 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-08-04 21:29:10,231 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-08-04 21:29:10,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:10,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:29:10,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-08-04 21:29:10,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:10,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:29:10,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:29:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:29:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:29:10,907 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-04 21:29:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:11,116 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-04 21:29:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:29:11,116 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-04 21:29:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:11,117 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:29:11,117 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:29:11,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:29:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:29:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:29:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:29:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-04 21:29:11,121 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-04 21:29:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:11,122 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-04 21:29:11,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:29:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-04 21:29:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:29:11,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:11,122 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-08-04 21:29:11,123 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-08-04 21:29:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:11,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:29:11,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-08-04 21:29:11,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:11,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:29:11,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:29:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:29:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:29:11,641 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-04 21:29:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:12,146 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-04 21:29:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:29:12,147 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-04 21:29:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:12,148 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:29:12,148 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:29:12,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:29:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:29:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:29:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:29:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-04 21:29:12,151 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-04 21:29:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:12,151 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-04 21:29:12,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:29:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-04 21:29:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:29:12,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:12,152 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-08-04 21:29:12,152 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-08-04 21:29:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:12,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:29:12,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-08-04 21:29:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:29:13,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:29:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:29:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:29:13,717 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-04 21:29:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:13,849 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-04 21:29:13,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:29:13,850 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-04 21:29:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:13,851 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:29:13,851 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:29:13,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:29:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:29:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:29:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:29:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-04 21:29:13,855 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-08-04 21:29:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:13,855 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-04 21:29:13,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:29:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-04 21:29:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:29:13,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:13,856 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-08-04 21:29:13,856 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-08-04 21:29:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:13,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:29:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-08-04 21:29:14,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:14,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:29:14,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:29:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:29:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:29:14,505 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-04 21:29:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:14,640 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-04 21:29:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:29:14,641 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-04 21:29:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:14,641 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:29:14,642 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:29:14,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:29:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:29:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:29:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:29:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-04 21:29:14,645 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-04 21:29:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:14,646 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-04 21:29:14,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:29:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-04 21:29:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:29:14,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:14,647 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-08-04 21:29:14,647 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-08-04 21:29:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:14,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:29:14,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-08-04 21:29:15,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:15,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:29:15,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:29:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:29:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:29:15,418 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-04 21:29:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:15,555 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-04 21:29:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:29:15,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-04 21:29:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:15,557 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:29:15,557 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:29:15,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:29:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:29:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:29:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:29:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-04 21:29:15,561 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-04 21:29:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:15,561 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-04 21:29:15,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:29:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-04 21:29:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:29:15,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:15,561 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-08-04 21:29:15,562 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-08-04 21:29:15,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:15,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:29:15,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-08-04 21:29:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:16,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:29:16,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:29:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:29:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:29:16,272 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-04 21:29:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:16,423 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-04 21:29:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:29:16,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-04 21:29:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:16,424 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:29:16,424 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:29:16,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:29:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:29:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:29:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:29:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-04 21:29:16,428 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-04 21:29:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:16,429 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-04 21:29:16,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:29:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-04 21:29:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:29:16,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:16,430 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-08-04 21:29:16,430 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-08-04 21:29:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:16,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:29:16,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-08-04 21:29:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:29:17,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:29:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:29:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:29:17,295 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-04 21:29:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:17,503 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-04 21:29:17,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:29:17,504 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-04 21:29:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:17,505 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:29:17,505 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:29:17,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:29:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:29:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:29:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:29:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-04 21:29:17,509 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-04 21:29:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:17,509 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-04 21:29:17,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:29:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-04 21:29:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:29:17,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:17,510 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-08-04 21:29:17,510 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-08-04 21:29:17,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:17,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:29:17,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-08-04 21:29:18,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:18,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:29:18,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:29:18,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:29:18,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:29:18,681 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-04 21:29:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:18,827 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-04 21:29:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:29:18,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-04 21:29:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:18,828 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:29:18,829 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:29:18,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:29:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:29:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:29:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:29:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-04 21:29:18,833 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-08-04 21:29:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:18,833 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-04 21:29:18,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:29:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-04 21:29:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:29:18,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:18,834 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-08-04 21:29:18,834 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-08-04 21:29:18,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:18,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:29:18,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-08-04 21:29:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:20,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:29:20,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:29:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:29:20,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:29:20,190 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-04 21:29:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:20,346 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-04 21:29:20,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:29:20,347 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-04 21:29:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:20,348 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:29:20,348 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:29:20,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:29:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:29:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:29:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:29:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-04 21:29:20,351 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-04 21:29:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:20,351 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-04 21:29:20,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:29:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-04 21:29:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:29:20,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:20,351 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-08-04 21:29:20,352 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-08-04 21:29:20,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:20,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:29:20,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-08-04 21:29:21,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:21,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:29:21,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:29:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:29:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:29:21,151 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-04 21:29:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:21,355 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-04 21:29:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:29:21,356 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-04 21:29:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:21,357 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:29:21,357 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:29:21,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:29:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:29:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:29:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:29:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-04 21:29:21,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-04 21:29:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:21,361 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-04 21:29:21,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:29:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-04 21:29:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:29:21,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:21,362 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-08-04 21:29:21,362 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-08-04 21:29:21,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:21,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:29:21,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-08-04 21:29:22,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:22,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:29:22,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:29:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:29:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:29:22,432 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-04 21:29:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:22,853 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-04 21:29:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:29:22,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-04 21:29:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:22,855 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:29:22,855 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:29:22,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:29:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:29:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:29:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:29:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-04 21:29:22,858 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-08-04 21:29:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-04 21:29:22,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:29:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-04 21:29:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:29:22,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:22,859 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-08-04 21:29:22,860 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-08-04 21:29:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:22,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:29:22,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-08-04 21:29:24,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:24,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:29:24,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:29:24,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:29:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:29:24,114 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-04 21:29:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:24,285 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-04 21:29:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:29:24,285 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-04 21:29:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:24,286 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:29:24,286 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:29:24,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:29:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:29:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:29:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:29:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-04 21:29:24,290 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-08-04 21:29:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:24,290 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-04 21:29:24,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:29:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-04 21:29:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:29:24,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:24,291 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-08-04 21:29:24,291 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-08-04 21:29:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:24,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:29:24,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-08-04 21:29:25,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:29:25,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:29:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:29:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:29:25,276 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-04 21:29:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:25,457 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-04 21:29:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:29:25,457 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-04 21:29:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:25,458 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:29:25,458 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:29:25,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:29:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:29:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:29:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:29:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-04 21:29:25,460 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-04 21:29:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:25,461 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-04 21:29:25,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:29:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-04 21:29:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:29:25,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:25,461 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-08-04 21:29:25,461 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-08-04 21:29:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:25,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:29:25,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-08-04 21:29:26,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:29:26,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:29:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:29:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:29:26,715 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-04 21:29:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:26,953 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-04 21:29:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:29:26,954 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-04 21:29:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:26,955 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:29:26,955 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:29:26,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:29:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:29:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:29:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:29:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-04 21:29:26,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-04 21:29:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:26,959 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-04 21:29:26,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:29:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-04 21:29:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:29:26,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:26,960 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-08-04 21:29:26,961 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-08-04 21:29:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:26,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:29:26,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-08-04 21:29:28,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:28,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:29:28,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:29:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:29:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:29:28,065 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-04 21:29:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:28,246 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-04 21:29:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:29:28,246 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-04 21:29:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:28,247 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:29:28,247 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:29:28,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:29:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:29:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:29:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:29:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-04 21:29:28,251 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-08-04 21:29:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:28,251 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-04 21:29:28,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:29:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-04 21:29:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:29:28,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:28,252 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-08-04 21:29:28,253 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-08-04 21:29:28,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:28,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:29:28,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-08-04 21:29:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:29:29,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:29:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:29:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:29:29,496 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-04 21:29:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:29,884 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-04 21:29:29,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:29:29,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-04 21:29:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:29,886 INFO L225 Difference]: With dead ends: 105 [2019-08-04 21:29:29,886 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:29:29,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:29:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:29:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:29:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:29:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-04 21:29:29,890 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-04 21:29:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:29,890 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-04 21:29:29,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:29:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-04 21:29:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:29:29,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:29,892 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-08-04 21:29:29,892 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-08-04 21:29:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:29,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:29:29,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-08-04 21:29:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:29:31,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:29:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:29:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:29:31,353 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-04 21:29:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:31,560 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-04 21:29:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:29:31,560 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-04 21:29:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:31,561 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:29:31,562 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:29:31,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:29:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:29:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:29:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:29:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-04 21:29:31,565 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-04 21:29:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:31,566 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-04 21:29:31,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:29:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-04 21:29:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:29:31,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:31,567 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-08-04 21:29:31,567 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-08-04 21:29:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:31,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:29:31,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-08-04 21:29:33,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:29:33,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:29:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:29:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:29:33,003 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-04 21:29:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:33,218 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-04 21:29:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:29:33,219 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-04 21:29:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:33,220 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:29:33,220 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:29:33,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:29:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:29:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:29:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:29:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-04 21:29:33,224 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-04 21:29:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:33,224 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-04 21:29:33,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:29:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-04 21:29:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:29:33,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:33,225 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-08-04 21:29:33,225 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-08-04 21:29:33,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:33,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:29:33,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-08-04 21:29:34,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:34,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:29:34,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:29:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:29:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:29:34,751 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-04 21:29:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:34,949 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-04 21:29:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:29:34,950 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-04 21:29:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:34,951 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:29:34,951 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:29:34,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:29:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:29:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:29:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:29:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-04 21:29:34,955 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-04 21:29:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:34,955 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-04 21:29:34,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:29:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-04 21:29:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:29:34,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:34,956 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-08-04 21:29:34,957 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-08-04 21:29:34,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:34,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:29:34,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-08-04 21:29:36,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:36,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:29:36,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:29:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:29:36,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:29:36,236 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-04 21:29:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:36,448 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-04 21:29:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:29:36,448 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-04 21:29:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:36,449 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:29:36,449 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:29:36,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:29:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:29:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:29:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:29:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-04 21:29:36,452 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-08-04 21:29:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:36,453 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-04 21:29:36,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:29:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-04 21:29:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:29:36,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:36,454 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-08-04 21:29:36,454 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-08-04 21:29:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:36,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:29:36,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-08-04 21:29:37,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:37,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:29:37,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:29:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:29:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:29:37,656 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-08-04 21:29:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:38,060 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-04 21:29:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:29:38,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-04 21:29:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:38,062 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:29:38,062 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:29:38,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:29:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:29:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:29:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:29:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-04 21:29:38,065 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-04 21:29:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:38,066 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-04 21:29:38,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:29:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-04 21:29:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:29:38,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:38,067 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-08-04 21:29:38,067 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-08-04 21:29:38,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:38,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:29:38,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-04 21:29:40,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:40,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:29:40,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:29:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:29:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:29:40,165 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-08-04 21:29:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:40,373 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-08-04 21:29:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:29:40,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-08-04 21:29:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:40,375 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:29:40,375 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:29:40,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:29:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:29:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-04 21:29:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:29:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-04 21:29:40,377 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-04 21:29:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:40,378 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-04 21:29:40,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:29:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-04 21:29:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:29:40,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:40,379 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-08-04 21:29:40,379 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:40,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-08-04 21:29:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:40,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:29:40,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-08-04 21:29:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:29:41,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:29:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:29:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:29:41,716 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-08-04 21:29:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:41,928 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-04 21:29:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:29:41,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-08-04 21:29:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:41,929 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:29:41,930 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:29:41,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:29:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:29:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:29:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:29:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-04 21:29:41,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-08-04 21:29:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:41,933 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-04 21:29:41,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:29:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-04 21:29:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:29:41,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:41,934 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-08-04 21:29:41,934 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-08-04 21:29:41,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:41,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:29:41,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-08-04 21:29:44,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:44,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:29:44,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:29:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:29:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:29:44,412 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-08-04 21:29:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:44,639 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-04 21:29:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:29:44,639 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-08-04 21:29:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:44,641 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:29:44,641 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:29:44,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:29:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:29:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-04 21:29:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:29:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-04 21:29:44,644 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-08-04 21:29:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:44,644 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-04 21:29:44,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:29:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-04 21:29:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:29:44,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:44,645 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-08-04 21:29:44,646 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-08-04 21:29:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:44,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:29:44,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-08-04 21:29:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:29:46,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:29:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:29:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:29:46,342 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-08-04 21:29:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:46,679 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-04 21:29:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:29:46,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-08-04 21:29:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:46,681 INFO L225 Difference]: With dead ends: 123 [2019-08-04 21:29:46,681 INFO L226 Difference]: Without dead ends: 123 [2019-08-04 21:29:46,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:29:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-04 21:29:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-04 21:29:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-04 21:29:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-04 21:29:46,684 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-04 21:29:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:46,684 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-04 21:29:46,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:29:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-04 21:29:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-04 21:29:46,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:46,685 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-08-04 21:29:46,686 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-08-04 21:29:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:46,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:29:46,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-08-04 21:29:48,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:48,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:29:48,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:29:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:29:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:29:48,149 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-08-04 21:29:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:48,399 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-04 21:29:48,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:29:48,399 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-08-04 21:29:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:48,400 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:29:48,400 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:29:48,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:29:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:29:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-04 21:29:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-04 21:29:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-04 21:29:48,403 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-04 21:29:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:48,403 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-04 21:29:48,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:29:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-04 21:29:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-04 21:29:48,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:48,404 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-08-04 21:29:48,405 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-08-04 21:29:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:48,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:29:48,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-08-04 21:29:50,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:50,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:29:50,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:29:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:29:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:29:50,270 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-08-04 21:29:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:50,500 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-04 21:29:50,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:29:50,501 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-08-04 21:29:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:50,502 INFO L225 Difference]: With dead ends: 127 [2019-08-04 21:29:50,502 INFO L226 Difference]: Without dead ends: 127 [2019-08-04 21:29:50,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:29:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-04 21:29:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-04 21:29:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-04 21:29:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-04 21:29:50,504 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-08-04 21:29:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:50,505 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-04 21:29:50,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:29:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-04 21:29:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-04 21:29:50,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:50,506 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-08-04 21:29:50,507 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-08-04 21:29:50,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:50,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:29:50,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-08-04 21:29:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:52,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:29:52,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:29:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:29:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:29:52,004 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-08-04 21:29:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:52,270 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-08-04 21:29:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:29:52,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-08-04 21:29:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:52,271 INFO L225 Difference]: With dead ends: 129 [2019-08-04 21:29:52,272 INFO L226 Difference]: Without dead ends: 129 [2019-08-04 21:29:52,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:29:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-04 21:29:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-04 21:29:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-04 21:29:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-04 21:29:52,274 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-04 21:29:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:52,275 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-04 21:29:52,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:29:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-04 21:29:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:29:52,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:52,276 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-08-04 21:29:52,276 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-08-04 21:29:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:52,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:29:52,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-08-04 21:29:53,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:53,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:29:53,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:29:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:29:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:29:53,735 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-08-04 21:29:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:53,972 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-04 21:29:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:29:53,973 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-08-04 21:29:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:53,974 INFO L225 Difference]: With dead ends: 131 [2019-08-04 21:29:53,974 INFO L226 Difference]: Without dead ends: 131 [2019-08-04 21:29:53,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:29:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-04 21:29:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-04 21:29:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-04 21:29:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-04 21:29:53,978 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-04 21:29:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:53,978 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-04 21:29:53,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:29:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-04 21:29:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-04 21:29:53,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:53,979 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-08-04 21:29:53,979 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-08-04 21:29:53,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:54,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:29:54,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-08-04 21:29:55,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:55,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:29:55,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:29:55,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:29:55,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:29:55,600 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-08-04 21:29:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:55,857 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-04 21:29:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:29:55,858 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-08-04 21:29:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:55,859 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:29:55,859 INFO L226 Difference]: Without dead ends: 133 [2019-08-04 21:29:55,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:29:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-04 21:29:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-04 21:29:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-04 21:29:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-04 21:29:55,862 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-04 21:29:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:55,862 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-04 21:29:55,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:29:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-04 21:29:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-04 21:29:55,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:55,863 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-08-04 21:29:55,863 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-08-04 21:29:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:55,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:29:55,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-08-04 21:29:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:29:57,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:29:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:29:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:29:57,404 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-08-04 21:29:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:57,668 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-04 21:29:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:29:57,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-08-04 21:29:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:57,669 INFO L225 Difference]: With dead ends: 135 [2019-08-04 21:29:57,669 INFO L226 Difference]: Without dead ends: 135 [2019-08-04 21:29:57,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:29:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-04 21:29:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-04 21:29:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-04 21:29:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-04 21:29:57,671 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-04 21:29:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:57,672 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-04 21:29:57,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:29:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-04 21:29:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-04 21:29:57,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:57,672 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-08-04 21:29:57,673 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-08-04 21:29:57,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:57,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:29:57,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-08-04 21:29:59,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:29:59,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:29:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:29:59,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:29:59,621 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-08-04 21:30:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:00,301 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-04 21:30:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:30:00,301 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-08-04 21:30:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:00,302 INFO L225 Difference]: With dead ends: 137 [2019-08-04 21:30:00,302 INFO L226 Difference]: Without dead ends: 137 [2019-08-04 21:30:00,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:30:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-04 21:30:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-04 21:30:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-04 21:30:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-04 21:30:00,306 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-08-04 21:30:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:00,306 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-04 21:30:00,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:30:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-04 21:30:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-04 21:30:00,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:00,307 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-08-04 21:30:00,308 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-08-04 21:30:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:00,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:30:00,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-08-04 21:30:02,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:02,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:30:02,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:30:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:30:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:30:02,526 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-08-04 21:30:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:02,908 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-04 21:30:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:30:02,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-08-04 21:30:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:02,910 INFO L225 Difference]: With dead ends: 139 [2019-08-04 21:30:02,910 INFO L226 Difference]: Without dead ends: 139 [2019-08-04 21:30:02,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:30:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-04 21:30:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-04 21:30:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-04 21:30:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-04 21:30:02,912 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-04 21:30:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:02,912 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-04 21:30:02,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:30:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-04 21:30:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-04 21:30:02,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:02,913 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-08-04 21:30:02,913 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-08-04 21:30:02,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:02,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:30:02,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-08-04 21:30:04,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:04,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:30:04,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:30:04,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:30:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:30:04,909 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-08-04 21:30:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:05,309 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-04 21:30:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:30:05,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-08-04 21:30:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:05,311 INFO L225 Difference]: With dead ends: 141 [2019-08-04 21:30:05,311 INFO L226 Difference]: Without dead ends: 141 [2019-08-04 21:30:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:30:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-04 21:30:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-04 21:30:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-04 21:30:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-04 21:30:05,313 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-04 21:30:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:05,313 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-04 21:30:05,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:30:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-04 21:30:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-04 21:30:05,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:05,314 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-08-04 21:30:05,314 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-08-04 21:30:05,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:05,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:30:05,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-08-04 21:30:07,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:07,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:30:07,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:30:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:30:07,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:30:07,074 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-08-04 21:30:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:07,393 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-04 21:30:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:30:07,394 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-08-04 21:30:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:07,395 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:30:07,395 INFO L226 Difference]: Without dead ends: 143 [2019-08-04 21:30:07,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:30:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-04 21:30:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-04 21:30:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-04 21:30:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-04 21:30:07,397 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-08-04 21:30:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:07,397 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-04 21:30:07,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:30:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-04 21:30:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-04 21:30:07,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:07,399 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-08-04 21:30:07,399 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-08-04 21:30:07,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:07,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:30:07,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-08-04 21:30:09,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:09,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:30:09,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:30:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:30:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:30:09,234 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-08-04 21:30:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:09,693 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-04 21:30:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:30:09,694 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-08-04 21:30:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:09,694 INFO L225 Difference]: With dead ends: 145 [2019-08-04 21:30:09,694 INFO L226 Difference]: Without dead ends: 145 [2019-08-04 21:30:09,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:30:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-04 21:30:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-04 21:30:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-04 21:30:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-04 21:30:09,697 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-08-04 21:30:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:09,698 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-04 21:30:09,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:30:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-04 21:30:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-04 21:30:09,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:09,699 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-08-04 21:30:09,699 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-08-04 21:30:09,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:09,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:30:09,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-08-04 21:30:11,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:11,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:30:11,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:30:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:30:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:30:11,607 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-08-04 21:30:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:11,952 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-04 21:30:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:30:11,952 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-08-04 21:30:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:11,953 INFO L225 Difference]: With dead ends: 147 [2019-08-04 21:30:11,953 INFO L226 Difference]: Without dead ends: 147 [2019-08-04 21:30:11,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:30:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-04 21:30:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-04 21:30:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-04 21:30:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-04 21:30:11,957 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-04 21:30:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:11,957 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-04 21:30:11,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:30:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-04 21:30:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-04 21:30:11,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:11,958 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-08-04 21:30:11,959 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-08-04 21:30:11,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:11,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:30:11,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-08-04 21:30:14,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:14,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:30:14,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:30:14,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:30:14,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:30:14,075 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-08-04 21:30:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:14,427 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-04 21:30:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:30:14,428 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-08-04 21:30:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:14,429 INFO L225 Difference]: With dead ends: 149 [2019-08-04 21:30:14,429 INFO L226 Difference]: Without dead ends: 149 [2019-08-04 21:30:14,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:30:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-04 21:30:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-04 21:30:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-04 21:30:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-04 21:30:14,432 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-08-04 21:30:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:14,433 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-04 21:30:14,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:30:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-04 21:30:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-04 21:30:14,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:14,434 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-08-04 21:30:14,434 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-08-04 21:30:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:14,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:30:14,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-08-04 21:30:16,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:16,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:30:16,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:30:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:30:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:30:16,623 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-08-04 21:30:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:17,000 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-04 21:30:17,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:30:17,006 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-08-04 21:30:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:17,007 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:30:17,007 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:30:17,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:30:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:30:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-04 21:30:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-04 21:30:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-04 21:30:17,010 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-08-04 21:30:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:17,011 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-04 21:30:17,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:30:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-04 21:30:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-04 21:30:17,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:17,012 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-08-04 21:30:17,012 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-08-04 21:30:17,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:17,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:30:17,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-08-04 21:30:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:30:19,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:30:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:30:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:30:19,117 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-08-04 21:30:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:19,601 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-04 21:30:19,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:30:19,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-08-04 21:30:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:19,603 INFO L225 Difference]: With dead ends: 153 [2019-08-04 21:30:19,603 INFO L226 Difference]: Without dead ends: 153 [2019-08-04 21:30:19,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:30:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-04 21:30:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-04 21:30:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-04 21:30:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-04 21:30:19,606 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-04 21:30:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:19,606 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-04 21:30:19,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:30:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-04 21:30:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-04 21:30:19,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:19,607 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-08-04 21:30:19,607 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-08-04 21:30:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:19,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:30:19,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-08-04 21:30:21,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:21,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:30:21,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:30:21,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:30:21,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:30:21,873 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-08-04 21:30:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:22,274 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-04 21:30:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:30:22,275 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-08-04 21:30:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:22,276 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:30:22,276 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:30:22,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:30:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:30:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-04 21:30:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-04 21:30:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-04 21:30:22,279 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-08-04 21:30:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:22,279 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-04 21:30:22,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:30:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-04 21:30:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-04 21:30:22,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:22,280 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-08-04 21:30:22,280 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-08-04 21:30:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:22,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:30:22,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-08-04 21:30:24,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:24,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:30:24,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:30:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:30:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:30:24,418 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-08-04 21:30:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:24,878 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-04 21:30:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:30:24,878 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-08-04 21:30:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:24,879 INFO L225 Difference]: With dead ends: 157 [2019-08-04 21:30:24,879 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:30:24,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:30:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:30:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-04 21:30:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:30:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-04 21:30:24,881 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-08-04 21:30:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:24,882 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-04 21:30:24,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:30:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-04 21:30:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-04 21:30:24,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:24,883 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-08-04 21:30:24,883 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-08-04 21:30:24,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:24,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:30:24,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-08-04 21:30:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:30:27,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:30:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:30:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:30:27,109 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-08-04 21:30:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:27,529 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-04 21:30:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:30:27,529 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-08-04 21:30:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:27,530 INFO L225 Difference]: With dead ends: 159 [2019-08-04 21:30:27,530 INFO L226 Difference]: Without dead ends: 159 [2019-08-04 21:30:27,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:30:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-04 21:30:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-04 21:30:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:30:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-04 21:30:27,533 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-04 21:30:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:27,533 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-04 21:30:27,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:30:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-04 21:30:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-04 21:30:27,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:27,534 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-08-04 21:30:27,534 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-08-04 21:30:27,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:27,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:30:27,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-08-04 21:30:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:30:29,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:30:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:30:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:30:29,710 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-08-04 21:30:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:30,253 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-04 21:30:30,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:30:30,254 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-08-04 21:30:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:30,255 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:30:30,255 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:30:30,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:30:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:30:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-04 21:30:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-04 21:30:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-08-04 21:30:30,259 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-08-04 21:30:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:30,259 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-08-04 21:30:30,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:30:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-08-04 21:30:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-04 21:30:30,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:30,260 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-08-04 21:30:30,260 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:30,261 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-08-04 21:30:30,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:30:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-08-04 21:30:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:30:32,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:30:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:30:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:30:32,548 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-08-04 21:30:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:33,004 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-04 21:30:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:30:33,005 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-08-04 21:30:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:33,006 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:30:33,006 INFO L226 Difference]: Without dead ends: 163 [2019-08-04 21:30:33,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:30:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-04 21:30:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-04 21:30:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-04 21:30:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-04 21:30:33,010 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-08-04 21:30:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:33,010 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-04 21:30:33,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:30:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-04 21:30:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-04 21:30:33,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:33,011 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-08-04 21:30:33,011 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-08-04 21:30:33,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:33,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:30:33,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-08-04 21:30:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:30:35,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:30:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:30:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:30:35,588 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-08-04 21:30:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:36,077 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-08-04 21:30:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:30:36,077 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-08-04 21:30:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:36,078 INFO L225 Difference]: With dead ends: 165 [2019-08-04 21:30:36,078 INFO L226 Difference]: Without dead ends: 165 [2019-08-04 21:30:36,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:30:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-04 21:30:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-04 21:30:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-04 21:30:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-04 21:30:36,081 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-04 21:30:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:36,081 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-04 21:30:36,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:30:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-04 21:30:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-04 21:30:36,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:36,082 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-08-04 21:30:36,083 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-08-04 21:30:36,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:36,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:30:36,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-08-04 21:30:38,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:30:38,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:30:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:30:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:30:38,421 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-08-04 21:30:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:39,266 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-04 21:30:39,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:30:39,267 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-08-04 21:30:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:39,268 INFO L225 Difference]: With dead ends: 167 [2019-08-04 21:30:39,268 INFO L226 Difference]: Without dead ends: 167 [2019-08-04 21:30:39,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:30:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-04 21:30:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-04 21:30:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-04 21:30:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-08-04 21:30:39,270 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-08-04 21:30:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:39,270 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-08-04 21:30:39,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:30:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-08-04 21:30:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-04 21:30:39,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:39,271 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-08-04 21:30:39,271 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-08-04 21:30:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:39,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:30:39,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-08-04 21:30:41,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:41,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:30:41,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:30:41,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:30:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:30:41,918 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-08-04 21:30:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:42,431 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-04 21:30:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:30:42,431 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-08-04 21:30:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:42,432 INFO L225 Difference]: With dead ends: 169 [2019-08-04 21:30:42,432 INFO L226 Difference]: Without dead ends: 169 [2019-08-04 21:30:42,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:30:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-04 21:30:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-04 21:30:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-04 21:30:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-08-04 21:30:42,435 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-08-04 21:30:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:42,435 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-08-04 21:30:42,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:30:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-08-04 21:30:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-04 21:30:42,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:42,436 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-08-04 21:30:42,436 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-08-04 21:30:42,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:30:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-08-04 21:30:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:44,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:30:44,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:30:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:30:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:30:44,935 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-08-04 21:30:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:45,557 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-08-04 21:30:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:30:45,558 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-08-04 21:30:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:45,558 INFO L225 Difference]: With dead ends: 171 [2019-08-04 21:30:45,559 INFO L226 Difference]: Without dead ends: 171 [2019-08-04 21:30:45,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:30:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-04 21:30:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-04 21:30:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-04 21:30:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-08-04 21:30:45,561 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-08-04 21:30:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:45,562 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-08-04 21:30:45,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:30:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-08-04 21:30:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-04 21:30:45,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:45,563 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-08-04 21:30:45,563 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-08-04 21:30:45,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:45,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:30:45,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-08-04 21:30:48,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:48,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:30:48,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:30:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:30:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:30:48,081 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-08-04 21:30:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:48,618 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-04 21:30:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:30:48,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-08-04 21:30:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:48,619 INFO L225 Difference]: With dead ends: 173 [2019-08-04 21:30:48,619 INFO L226 Difference]: Without dead ends: 173 [2019-08-04 21:30:48,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:30:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-04 21:30:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-04 21:30:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-04 21:30:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-08-04 21:30:48,623 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-08-04 21:30:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:48,623 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-08-04 21:30:48,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:30:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-08-04 21:30:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-04 21:30:48,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:48,625 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-08-04 21:30:48,625 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-08-04 21:30:48,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:48,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:30:48,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-08-04 21:30:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:51,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:30:51,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:30:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:30:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:30:51,454 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-08-04 21:30:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:52,032 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-08-04 21:30:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:30:52,033 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-08-04 21:30:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:52,034 INFO L225 Difference]: With dead ends: 175 [2019-08-04 21:30:52,034 INFO L226 Difference]: Without dead ends: 175 [2019-08-04 21:30:52,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:30:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-04 21:30:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-04 21:30:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-04 21:30:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-08-04 21:30:52,037 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-08-04 21:30:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:52,037 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-08-04 21:30:52,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:30:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-08-04 21:30:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-04 21:30:52,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:52,039 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-08-04 21:30:52,040 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-08-04 21:30:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:52,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:30:52,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-08-04 21:30:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:30:54,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:30:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:30:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:30:54,708 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-08-04 21:30:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:55,284 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-08-04 21:30:55,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:30:55,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-08-04 21:30:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:55,286 INFO L225 Difference]: With dead ends: 177 [2019-08-04 21:30:55,286 INFO L226 Difference]: Without dead ends: 177 [2019-08-04 21:30:55,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:30:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-04 21:30:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-08-04 21:30:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-04 21:30:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-08-04 21:30:55,289 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-08-04 21:30:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:55,290 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-08-04 21:30:55,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:30:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-08-04 21:30:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-04 21:30:55,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:55,291 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-08-04 21:30:55,291 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-08-04 21:30:55,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:55,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:30:55,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-08-04 21:30:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:30:58,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:30:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:30:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:30:58,315 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-08-04 21:30:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:58,942 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-08-04 21:30:58,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:30:58,942 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-08-04 21:30:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:58,943 INFO L225 Difference]: With dead ends: 179 [2019-08-04 21:30:58,944 INFO L226 Difference]: Without dead ends: 179 [2019-08-04 21:30:58,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:30:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-04 21:30:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-04 21:30:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-04 21:30:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-08-04 21:30:58,946 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-08-04 21:30:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:58,946 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-08-04 21:30:58,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:30:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-08-04 21:30:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-04 21:30:58,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:58,947 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-08-04 21:30:58,947 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-08-04 21:30:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:58,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:30:58,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-08-04 21:31:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:31:02,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:31:02,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:31:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:31:02,024 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-08-04 21:31:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:02,637 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-08-04 21:31:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:31:02,638 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-08-04 21:31:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:02,639 INFO L225 Difference]: With dead ends: 181 [2019-08-04 21:31:02,639 INFO L226 Difference]: Without dead ends: 181 [2019-08-04 21:31:02,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:31:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-04 21:31:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-04 21:31:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-04 21:31:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-08-04 21:31:02,641 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-08-04 21:31:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:02,641 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-08-04 21:31:02,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:31:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-08-04 21:31:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-04 21:31:02,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:02,642 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-08-04 21:31:02,642 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-08-04 21:31:02,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:02,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:31:02,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-08-04 21:31:05,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:05,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:31:05,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:31:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:31:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:31:05,490 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-08-04 21:31:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:06,312 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-04 21:31:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:31:06,312 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-08-04 21:31:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:06,313 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:31:06,313 INFO L226 Difference]: Without dead ends: 183 [2019-08-04 21:31:06,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:31:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-04 21:31:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-04 21:31:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-04 21:31:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-08-04 21:31:06,316 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-08-04 21:31:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:06,317 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-08-04 21:31:06,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:31:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-08-04 21:31:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-04 21:31:06,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:06,318 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-08-04 21:31:06,318 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-08-04 21:31:06,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:06,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:31:06,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-08-04 21:31:09,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:09,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:31:09,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:31:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:31:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:31:09,179 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-08-04 21:31:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:09,839 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-08-04 21:31:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:31:09,840 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-08-04 21:31:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:09,841 INFO L225 Difference]: With dead ends: 185 [2019-08-04 21:31:09,841 INFO L226 Difference]: Without dead ends: 185 [2019-08-04 21:31:09,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:31:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-04 21:31:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-04 21:31:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-04 21:31:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-08-04 21:31:09,843 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-08-04 21:31:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:09,843 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-08-04 21:31:09,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:31:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-08-04 21:31:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-04 21:31:09,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:09,844 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-08-04 21:31:09,845 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-08-04 21:31:09,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:09,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:31:09,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-08-04 21:31:13,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:13,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:31:13,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:31:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:31:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:31:13,042 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-08-04 21:31:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:13,738 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-08-04 21:31:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:31:13,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-08-04 21:31:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:13,740 INFO L225 Difference]: With dead ends: 187 [2019-08-04 21:31:13,740 INFO L226 Difference]: Without dead ends: 187 [2019-08-04 21:31:13,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:31:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-04 21:31:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-04 21:31:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-04 21:31:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-08-04 21:31:13,744 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-08-04 21:31:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:13,745 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-08-04 21:31:13,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:31:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-08-04 21:31:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-04 21:31:13,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:13,746 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-08-04 21:31:13,746 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-08-04 21:31:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:13,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:31:13,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-08-04 21:31:17,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:31:17,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:31:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:31:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:31:17,094 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-08-04 21:31:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:17,850 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-08-04 21:31:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:31:17,850 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-08-04 21:31:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:17,851 INFO L225 Difference]: With dead ends: 189 [2019-08-04 21:31:17,851 INFO L226 Difference]: Without dead ends: 189 [2019-08-04 21:31:17,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:31:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-04 21:31:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-04 21:31:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-04 21:31:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-08-04 21:31:17,854 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-08-04 21:31:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:17,854 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-08-04 21:31:17,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:31:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-08-04 21:31:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-04 21:31:17,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:17,855 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-08-04 21:31:17,855 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-08-04 21:31:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:17,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:31:17,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-08-04 21:31:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:31:21,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:31:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:31:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:31:21,373 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-08-04 21:31:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:22,135 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-08-04 21:31:22,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:31:22,135 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-08-04 21:31:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:22,137 INFO L225 Difference]: With dead ends: 191 [2019-08-04 21:31:22,137 INFO L226 Difference]: Without dead ends: 191 [2019-08-04 21:31:22,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:31:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-04 21:31:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-04 21:31:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-04 21:31:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-08-04 21:31:22,141 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-08-04 21:31:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:22,141 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-08-04 21:31:22,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:31:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-08-04 21:31:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-04 21:31:22,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:22,142 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-08-04 21:31:22,142 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-08-04 21:31:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:31:22,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-08-04 21:31:25,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:25,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:31:25,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:31:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:31:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:31:25,343 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-08-04 21:31:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:26,116 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-04 21:31:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:31:26,116 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-08-04 21:31:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:26,118 INFO L225 Difference]: With dead ends: 193 [2019-08-04 21:31:26,118 INFO L226 Difference]: Without dead ends: 193 [2019-08-04 21:31:26,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:31:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-04 21:31:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-08-04 21:31:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-04 21:31:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-08-04 21:31:26,121 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-08-04 21:31:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:26,121 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-08-04 21:31:26,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:31:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-08-04 21:31:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-04 21:31:26,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:26,122 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-08-04 21:31:26,122 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-08-04 21:31:26,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:26,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:31:26,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-04 21:31:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:31:30,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:31:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:31:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:31:30,011 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-08-04 21:31:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:30,803 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-08-04 21:31:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:31:30,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-08-04 21:31:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:30,804 INFO L225 Difference]: With dead ends: 195 [2019-08-04 21:31:30,804 INFO L226 Difference]: Without dead ends: 195 [2019-08-04 21:31:30,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:31:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-04 21:31:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-04 21:31:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-04 21:31:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-08-04 21:31:30,806 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-08-04 21:31:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:30,807 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-08-04 21:31:30,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:31:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-08-04 21:31:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-04 21:31:30,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:30,810 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-08-04 21:31:30,810 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-08-04 21:31:30,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:30,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:31:30,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-08-04 21:31:34,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:34,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:31:34,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:31:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:31:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:31:34,288 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-08-04 21:31:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:35,056 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-08-04 21:31:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:31:35,056 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-08-04 21:31:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:35,058 INFO L225 Difference]: With dead ends: 197 [2019-08-04 21:31:35,058 INFO L226 Difference]: Without dead ends: 197 [2019-08-04 21:31:35,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:31:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-04 21:31:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-04 21:31:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-04 21:31:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-08-04 21:31:35,062 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-08-04 21:31:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:35,062 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-08-04 21:31:35,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:31:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-08-04 21:31:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-04 21:31:35,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:35,064 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-08-04 21:31:35,064 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-08-04 21:31:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:35,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:31:35,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-08-04 21:31:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:31:38,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:31:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:31:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:31:38,617 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-08-04 21:31:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:39,349 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-08-04 21:31:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:31:39,349 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-08-04 21:31:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:39,350 INFO L225 Difference]: With dead ends: 199 [2019-08-04 21:31:39,350 INFO L226 Difference]: Without dead ends: 199 [2019-08-04 21:31:39,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:31:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-04 21:31:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-04 21:31:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-04 21:31:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-08-04 21:31:39,352 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-08-04 21:31:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:39,353 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-08-04 21:31:39,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:31:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-08-04 21:31:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-04 21:31:39,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:39,354 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-08-04 21:31:39,354 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-08-04 21:31:39,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:39,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:31:39,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-08-04 21:31:42,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:42,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:31:42,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:31:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:31:42,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:31:42,993 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-08-04 21:31:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:43,758 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-08-04 21:31:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:31:43,758 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-08-04 21:31:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:43,759 INFO L225 Difference]: With dead ends: 201 [2019-08-04 21:31:43,759 INFO L226 Difference]: Without dead ends: 201 [2019-08-04 21:31:43,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:31:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-04 21:31:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-08-04 21:31:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-04 21:31:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-08-04 21:31:43,762 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-08-04 21:31:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:43,762 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-08-04 21:31:43,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:31:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-08-04 21:31:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-04 21:31:43,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:43,763 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-08-04 21:31:43,764 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-08-04 21:31:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:43,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:31:43,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-08-04 21:31:47,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:47,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:31:47,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:31:47,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:31:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:31:47,427 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-08-04 21:31:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:48,225 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-04 21:31:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:31:48,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-08-04 21:31:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:48,226 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:31:48,226 INFO L226 Difference]: Without dead ends: 203 [2019-08-04 21:31:48,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:31:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-04 21:31:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-04 21:31:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-04 21:31:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-08-04 21:31:48,228 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-08-04 21:31:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:48,228 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-08-04 21:31:48,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:31:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-08-04 21:31:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-04 21:31:48,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:48,229 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-08-04 21:31:48,230 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-08-04 21:31:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:48,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:31:48,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-08-04 21:31:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:31:51,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:31:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:31:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:31:51,773 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-08-04 21:31:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:52,731 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-08-04 21:31:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:31:52,732 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-08-04 21:31:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:52,732 INFO L225 Difference]: With dead ends: 205 [2019-08-04 21:31:52,733 INFO L226 Difference]: Without dead ends: 205 [2019-08-04 21:31:52,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:31:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-04 21:31:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-04 21:31:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-04 21:31:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-08-04 21:31:52,735 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-08-04 21:31:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:52,735 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-08-04 21:31:52,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:31:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-08-04 21:31:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-04 21:31:52,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:52,736 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-08-04 21:31:52,736 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-08-04 21:31:52,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:52,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:31:52,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:31:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-08-04 21:31:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:31:56,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-04 21:31:56,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:31:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:31:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:31:56,315 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-08-04 21:31:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:31:57,282 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-08-04 21:31:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:31:57,282 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-08-04 21:31:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:31:57,283 INFO L225 Difference]: With dead ends: 207 [2019-08-04 21:31:57,283 INFO L226 Difference]: Without dead ends: 207 [2019-08-04 21:31:57,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:31:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-04 21:31:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-04 21:31:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-04 21:31:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-08-04 21:31:57,286 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-08-04 21:31:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:31:57,286 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-08-04 21:31:57,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:31:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-08-04 21:31:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-04 21:31:57,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:31:57,288 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-08-04 21:31:57,288 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:31:57,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:31:57,288 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-08-04 21:31:57,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:31:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:31:57,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:31:57,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-08-04 21:32:00,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:00,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:32:00,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:32:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:32:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:32:00,962 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-08-04 21:32:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:01,878 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-08-04 21:32:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:32:01,878 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-08-04 21:32:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:01,879 INFO L225 Difference]: With dead ends: 209 [2019-08-04 21:32:01,879 INFO L226 Difference]: Without dead ends: 209 [2019-08-04 21:32:01,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:32:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-04 21:32:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-04 21:32:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-04 21:32:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-08-04 21:32:01,882 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-08-04 21:32:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:01,882 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-08-04 21:32:01,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:32:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-08-04 21:32:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-04 21:32:01,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:01,884 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-08-04 21:32:01,884 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-08-04 21:32:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:32:01,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:32:01,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:32:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-08-04 21:32:05,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:32:05,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-04 21:32:05,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-04 21:32:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-04 21:32:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:32:05,909 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-08-04 21:32:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:32:06,926 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2019-08-04 21:32:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-04 21:32:06,926 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-08-04 21:32:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:32:06,927 INFO L225 Difference]: With dead ends: 211 [2019-08-04 21:32:06,927 INFO L226 Difference]: Without dead ends: 211 [2019-08-04 21:32:06,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:32:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-04 21:32:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-08-04 21:32:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-04 21:32:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-08-04 21:32:06,930 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-08-04 21:32:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:32:06,931 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-08-04 21:32:06,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-04 21:32:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-08-04 21:32:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-08-04 21:32:06,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:32:06,932 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-08-04 21:32:06,932 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:32:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:32:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-08-04 21:32:06,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:32:27,343 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.OutOfMemoryError: Java heap space at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.resize(CuckooHashSet.java:110) at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.add_internal(CuckooHashSet.java:146) at de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.add(CuckooHashSet.java:196) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.insertEqualityEntry(CClosure.java:154) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.createCCEquality(CClosure.java:188) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:190) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier$CollectLiterals.perform(Clausifier.java:740) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier.run(Clausifier.java:1669) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier.addFormula(Clausifier.java:1733) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:644) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertConjunctsOfCodeBlocks.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertConjuncts(AnnotateAndAssertConjunctsOfCodeBlocks.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAssertConjunctsOfCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertConjunctsOfCodeBlocks.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:293) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) [2019-08-04 21:32:27,349 INFO L168 Benchmark]: Toolchain (without parser) took 215844.18 ms. Allocated memory was 135.3 MB in the beginning and 5.9 GB in the end (delta: 5.8 GB). Free memory was 110.5 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,349 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 111.8 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.47 ms. Allocated memory is still 135.3 MB. Free memory was 110.3 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,351 INFO L168 Benchmark]: Boogie Preprocessor took 22.61 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,351 INFO L168 Benchmark]: RCFGBuilder took 307.10 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 97.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,352 INFO L168 Benchmark]: TraceAbstraction took 215473.17 ms. Allocated memory was 135.3 MB in the beginning and 5.9 GB in the end (delta: 5.8 GB). Free memory was 97.4 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2019-08-04 21:32:27,355 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 111.8 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.47 ms. Allocated memory is still 135.3 MB. Free memory was 110.3 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.61 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 307.10 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 97.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215473.17 ms. Allocated memory was 135.3 MB in the beginning and 5.9 GB in the end (delta: 5.8 GB). Free memory was 97.4 MB in the beginning and 3.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: OutOfMemoryError: Java heap space de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: OutOfMemoryError: Java heap space: de.uni_freiburg.informatik.ultimate.smtinterpol.util.CuckooHashSet.resize(CuckooHashSet.java:110) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...