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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:16,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:16,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:16,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:16,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:16,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:16,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:16,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:16,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:16,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:16,380 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:16,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:16,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:16,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:16,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:16,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:16,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:16,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:16,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:16,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:16,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:16,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:16,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:16,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:16,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:16,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:16,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:16,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:16,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:16,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:16,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:16,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:16,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:16,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:16,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:16,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:16,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:16,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:16,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:16,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:16,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:16,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:16,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:16,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:16,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:16,485 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:16,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-08-05 10:31:16,486 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-08-05 10:31:16,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:16,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:16,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:16,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:16,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:16,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:16,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:16,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:16,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:16,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/1) ... [2019-08-05 10:31:16,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:16,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:16,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:16,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:16,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (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-05 10:31:16,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:31:16,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:31:16,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:31:17,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:31:17,092 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:17,094 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:17 BoogieIcfgContainer [2019-08-05 10:31:17,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:17,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:17,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:17,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:17,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:16" (1/2) ... [2019-08-05 10:31:17,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb6ca7a and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:17, skipping insertion in model container [2019-08-05 10:31:17,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:17" (2/2) ... [2019-08-05 10:31:17,111 INFO L109 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-08-05 10:31:17,127 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:17,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:17,153 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:17,181 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:17,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:17,182 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:17,182 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:17,182 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:17,182 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:17,182 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:17,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:17,183 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:31:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:17,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:17,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:31:17,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29056668, now seen corresponding path program 1 times [2019-08-05 10:31:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:17,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:17,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,429 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-05 10:31:17,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:17,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:31:17,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:17,449 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 10:31:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:17,561 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:31:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:17,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:31:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:17,573 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:17,574 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:17,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:31:17,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-08-05 10:31:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:17,610 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:31:17,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:31:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:17,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:17,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:31:17,611 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash 923948517, now seen corresponding path program 1 times [2019-08-05 10:31:17,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:17,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:31:17,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:17,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:17,923 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2019-08-05 10:31:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,194 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:31:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:18,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:31:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,195 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:18,195 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:18,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:31:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:31:18,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 10:31:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,199 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:31:18,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:31:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:18,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,201 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:18,201 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1091246844, now seen corresponding path program 1 times [2019-08-05 10:31:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:18,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:18,313 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-05 10:31:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,496 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:31:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:18,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:31:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,498 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:18,498 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:18,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:31:18,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 10:31:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,502 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:31:18,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:31:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:18,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,503 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:18,504 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,504 INFO L82 PathProgramCache]: Analyzing trace with hash -167964723, now seen corresponding path program 2 times [2019-08-05 10:31:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:18,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:18,811 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 10:31:19,009 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:31:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,226 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:31:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:19,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:31:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,228 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:19,228 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:19,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 10:31:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:31:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:31:19,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-08-05 10:31:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,232 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:31:19,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:31:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:19,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,233 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:19,233 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash -196279780, now seen corresponding path program 3 times [2019-08-05 10:31:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:19,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:19,405 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2019-08-05 10:31:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,550 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:31:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:19,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:31:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,553 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:31:19,553 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:19,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:31:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:31:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:31:19,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 10:31:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,557 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:31:19,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:31:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:19,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,558 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:31:19,558 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1035952027, now seen corresponding path program 4 times [2019-08-05 10:31:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:19,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:19,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:19,877 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-05 10:31:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,017 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:31:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:20,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:31:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,026 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:20,027 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:20,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 10:31:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:31:20,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-08-05 10:31:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,034 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:31:20,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:31:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:20,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,036 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 10:31:20,037 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1592035972, now seen corresponding path program 5 times [2019-08-05 10:31:20,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:20,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:20,255 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2019-08-05 10:31:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,393 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:31:20,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:20,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:31:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,394 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:20,394 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:20,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:31:20,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-05 10:31:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,398 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:31:20,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:31:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:20,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,399 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:31:20,399 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1310860211, now seen corresponding path program 6 times [2019-08-05 10:31:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:20,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:20,585 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2019-08-05 10:31:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,764 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:31:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:20,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:31:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,766 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:20,766 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:20,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 10:31:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:31:20,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2019-08-05 10:31:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,770 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:31:20,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:31:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:20,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,771 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 10:31:20,771 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1990007396, now seen corresponding path program 7 times [2019-08-05 10:31:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:20,951 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2019-08-05 10:31:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,126 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 10:31:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:21,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:31:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,131 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:31:21,131 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:21,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:31:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:31:21,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2019-08-05 10:31:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,135 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:31:21,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:31:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:21,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,136 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:31:21,137 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash 945564389, now seen corresponding path program 8 times [2019-08-05 10:31:21,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:21,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:21,451 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 14 states. [2019-08-05 10:31:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,371 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:31:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:22,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 10:31:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,376 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:22,376 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:22,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 10:31:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 10:31:22,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-08-05 10:31:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,380 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 10:31:22,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 10:31:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:22,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,381 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 10:31:22,382 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1377898492, now seen corresponding path program 9 times [2019-08-05 10:31:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:22,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:22,699 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-08-05 10:31:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,917 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:31:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:22,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:31:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,919 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:22,919 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:22,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:31:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:31:22,924 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2019-08-05 10:31:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,925 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:31:22,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:31:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:22,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,926 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2019-08-05 10:31:22,926 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 145909965, now seen corresponding path program 10 times [2019-08-05 10:31:22,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:23,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:23,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:23,210 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-08-05 10:31:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,590 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:31:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:23,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:31:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,591 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:31:23,592 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:23,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 10:31:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:31:23,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2019-08-05 10:31:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,597 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:31:23,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:31:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:23,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,598 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 10:31:23,598 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 300747036, now seen corresponding path program 11 times [2019-08-05 10:31:23,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:23,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:23,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:23,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:23,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:23,887 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-08-05 10:31:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,063 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 10:31:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:24,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:31:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,064 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:31:24,064 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:24,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:31:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:31:24,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:31:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,070 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:31:24,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:31:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:24,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,071 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2019-08-05 10:31:24,071 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1901393253, now seen corresponding path program 12 times [2019-08-05 10:31:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:24,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:24,712 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 18 states. [2019-08-05 10:31:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,028 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:31:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:25,029 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 10:31:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,029 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:31:25,030 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:31:25,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:31:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 10:31:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:31:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:31:25,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-08-05 10:31:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,034 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:31:25,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:31:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:25,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,035 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 10:31:25,036 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1913383548, now seen corresponding path program 13 times [2019-08-05 10:31:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:25,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:25,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:25,273 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2019-08-05 10:31:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,500 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 10:31:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:25,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:31:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,502 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:31:25,502 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:31:25,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:31:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:31:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:31:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:31:25,507 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2019-08-05 10:31:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,507 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:31:25,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:31:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:31:25,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,508 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2019-08-05 10:31:25,508 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash -477448883, now seen corresponding path program 14 times [2019-08-05 10:31:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:26,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:26,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:26,021 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 20 states. [2019-08-05 10:31:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,577 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:31:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:26,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 10:31:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,578 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:31:26,579 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:26,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 10:31:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 10:31:26,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2019-08-05 10:31:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,584 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 10:31:26,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 10:31:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:31:26,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,585 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 10:31:26,585 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1255894172, now seen corresponding path program 15 times [2019-08-05 10:31:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:26,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:26,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:26,848 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 20 states. [2019-08-05 10:31:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,101 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 10:31:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:27,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:31:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,103 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:31:27,103 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:27,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:31:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:31:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:31:27,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-08-05 10:31:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,107 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:31:27,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:31:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:31:27,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,108 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2019-08-05 10:31:27,108 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1323630619, now seen corresponding path program 16 times [2019-08-05 10:31:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:27,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:27,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:27,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:27,568 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-08-05 10:31:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,447 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:31:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:28,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 10:31:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,449 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:28,449 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:31:28,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:31:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 10:31:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:31:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:31:28,453 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-08-05 10:31:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,453 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:31:28,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:31:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:31:28,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,454 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 10:31:28,454 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash -181142780, now seen corresponding path program 17 times [2019-08-05 10:31:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 126 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:28,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:28,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:28,806 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 22 states. [2019-08-05 10:31:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,082 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:31:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:29,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:31:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,083 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:31:29,083 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:31:29,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:31:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:31:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:31:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:31:29,088 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-05 10:31:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,089 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:31:29,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:31:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:31:29,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,090 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2019-08-05 10:31:29,090 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1064747469, now seen corresponding path program 18 times [2019-08-05 10:31:29,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:29,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:29,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:29,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:29,737 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 24 states. [2019-08-05 10:31:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:30,519 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:31:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:30,519 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 10:31:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:30,520 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:31:30,520 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:31:30,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:31:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 10:31:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:31:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:31:30,525 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2019-08-05 10:31:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:30,525 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:31:30,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:31:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:31:30,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:30,527 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 10:31:30,527 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1562251292, now seen corresponding path program 19 times [2019-08-05 10:31:30,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:31:30,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 155 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:30,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:30,892 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 24 states. [2019-08-05 10:31:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,258 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 10:31:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:31,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:31:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,259 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:31:31,259 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:31:31,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:31:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:31:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:31:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:31:31,262 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2019-08-05 10:31:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,263 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:31:31,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:31:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:31:31,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,264 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2019-08-05 10:31:31,264 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1482798491, now seen corresponding path program 20 times [2019-08-05 10:31:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:31,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:31:31,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:31,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:31,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:31,852 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2019-08-05 10:31:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,512 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 10:31:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:32,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 10:31:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,516 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:31:32,516 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:31:32,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:31:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 10:31:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:31:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 10:31:32,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-08-05 10:31:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,521 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 10:31:32,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 10:31:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:31:32,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,522 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 10:31:32,522 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -307322748, now seen corresponding path program 21 times [2019-08-05 10:31:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 187 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:32,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:32,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:32,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:32,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:32,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:32,882 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 26 states. [2019-08-05 10:31:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,198 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:31:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:33,198 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:31:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,199 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:31:33,199 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:31:33,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:31:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:31:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:31:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:31:33,204 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2019-08-05 10:31:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,204 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:31:33,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:31:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:31:33,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,205 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2019-08-05 10:31:33,205 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 763792973, now seen corresponding path program 22 times [2019-08-05 10:31:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:33,766 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 28 states. [2019-08-05 10:31:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:34,528 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:31:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:34,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 10:31:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:34,530 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:31:34,530 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:31:34,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:31:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 10:31:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:31:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 10:31:34,535 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2019-08-05 10:31:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:34,535 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 10:31:34,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 10:31:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:31:34,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:34,536 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1] [2019-08-05 10:31:34,536 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -576392292, now seen corresponding path program 23 times [2019-08-05 10:31:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:34,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:34,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 222 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:34,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:34,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:34,929 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2019-08-05 10:31:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,359 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 10:31:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:35,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:31:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,361 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:31:35,361 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:31:35,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:31:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:31:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:31:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:31:35,365 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-05 10:31:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,366 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:31:35,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:31:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:31:35,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,367 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2019-08-05 10:31:35,367 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1892603109, now seen corresponding path program 24 times [2019-08-05 10:31:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:35,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:35,966 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 30 states. [2019-08-05 10:31:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,989 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:31:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:36,990 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 10:31:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,991 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:31:36,991 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:31:36,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:31:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 10:31:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:31:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 10:31:36,994 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-08-05 10:31:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 10:31:36,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 10:31:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:31:36,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,995 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1] [2019-08-05 10:31:36,995 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1787558396, now seen corresponding path program 25 times [2019-08-05 10:31:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:37,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:31:37,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 260 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:37,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:37,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:37,564 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 30 states. [2019-08-05 10:31:38,098 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:31:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,121 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:31:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:38,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:31:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,122 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:31:38,122 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:31:38,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:31:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:31:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:31:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:31:38,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 57 [2019-08-05 10:31:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,125 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:31:38,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:31:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:31:38,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,129 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2019-08-05 10:31:38,129 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -758506803, now seen corresponding path program 26 times [2019-08-05 10:31:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:39,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:39,474 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 32 states. [2019-08-05 10:31:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,412 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:31:40,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:40,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 10:31:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,413 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:31:40,413 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:31:40,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:31:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 10:31:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:31:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-05 10:31:40,416 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 58 [2019-08-05 10:31:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,416 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-05 10:31:40,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-05 10:31:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:31:40,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,417 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1] [2019-08-05 10:31:40,417 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -849340644, now seen corresponding path program 27 times [2019-08-05 10:31:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 301 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:41,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:41,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:41,103 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 32 states. [2019-08-05 10:31:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:41,836 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 10:31:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:41,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:31:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:41,837 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:31:41,837 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:31:41,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:31:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:31:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:31:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:31:41,842 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2019-08-05 10:31:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:41,842 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:31:41,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:31:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:31:41,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:41,843 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2019-08-05 10:31:41,843 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1801674907, now seen corresponding path program 28 times [2019-08-05 10:31:41,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:41,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:31:41,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:42,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:31:42,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:31:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:31:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:42,550 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 34 states. [2019-08-05 10:31:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:43,545 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:31:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:43,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 10:31:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:43,546 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:31:43,546 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:31:43,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:31:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 10:31:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:31:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 10:31:43,551 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-08-05 10:31:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:43,551 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 10:31:43,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:31:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 10:31:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:31:43,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:43,552 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1] [2019-08-05 10:31:43,552 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash 513026948, now seen corresponding path program 29 times [2019-08-05 10:31:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:43,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:31:43,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 345 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:31:44,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:31:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:31:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:44,037 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 34 states. [2019-08-05 10:31:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:44,607 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:31:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:44,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:31:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:44,609 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:31:44,609 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:31:44,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:31:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:31:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:31:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:31:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:31:44,613 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-05 10:31:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:44,613 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:31:44,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:31:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:31:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:31:44,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:44,614 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2019-08-05 10:31:44,614 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1750165325, now seen corresponding path program 30 times [2019-08-05 10:31:44,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:44,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:31:44,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:45,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:31:45,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:31:45,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:31:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:45,537 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 36 states. [2019-08-05 10:31:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:46,901 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:31:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:31:46,901 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 10:31:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:46,901 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:31:46,902 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:31:46,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:31:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 10:31:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:31:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 10:31:46,905 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 66 [2019-08-05 10:31:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:46,905 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 10:31:46,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:31:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 10:31:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:31:46,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:46,906 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1] [2019-08-05 10:31:46,906 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1723893092, now seen corresponding path program 31 times [2019-08-05 10:31:46,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:46,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:31:46,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 392 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:31:48,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:31:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:31:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:48,419 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 36 states. [2019-08-05 10:31:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,981 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-08-05 10:31:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:31:48,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:31:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,983 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:31:48,983 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:31:48,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:31:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:31:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:31:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 10:31:48,987 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 69 [2019-08-05 10:31:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,988 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 10:31:48,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:31:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 10:31:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:31:48,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,988 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2019-08-05 10:31:48,989 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 116894181, now seen corresponding path program 32 times [2019-08-05 10:31:48,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:49,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:31:49,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:31:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:31:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1316, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:49,843 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 38 states. [2019-08-05 10:31:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,213 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 10:31:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:51,213 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 10:31:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,214 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:31:51,215 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:51,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 10:31:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:31:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 10:31:51,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2019-08-05 10:31:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,219 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 10:31:51,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:31:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 10:31:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:31:51,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,220 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1] [2019-08-05 10:31:51,220 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -820047612, now seen corresponding path program 33 times [2019-08-05 10:31:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 442 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:31:51,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:31:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:31:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:51,926 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 38 states. [2019-08-05 10:31:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,723 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:31:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:52,723 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:31:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,724 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:31:52,724 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:52,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:31:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:31:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:31:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:31:52,728 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 73 [2019-08-05 10:31:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,728 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:31:52,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:31:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:31:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:31:52,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,730 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2019-08-05 10:31:52,730 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash 992768973, now seen corresponding path program 34 times [2019-08-05 10:31:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:53,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:31:53,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:31:53,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:31:53,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:53,664 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 40 states. [2019-08-05 10:31:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,179 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:31:55,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:31:55,180 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 10:31:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,181 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:31:55,181 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:31:55,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:31:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 10:31:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:31:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 10:31:55,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 74 [2019-08-05 10:31:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,185 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 10:31:55,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:31:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 10:31:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:31:55,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,186 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2019-08-05 10:31:55,186 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash 439557660, now seen corresponding path program 35 times [2019-08-05 10:31:55,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:55,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 495 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:56,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:56,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:31:56,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:31:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:31:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:56,325 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 40 states. [2019-08-05 10:31:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:57,165 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-05 10:31:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:31:57,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:31:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:57,167 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:31:57,167 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:31:57,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:31:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:31:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:31:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:31:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:31:57,171 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-05 10:31:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:57,172 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:31:57,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:31:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:31:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:31:57,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:57,173 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2019-08-05 10:31:57,173 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 667939941, now seen corresponding path program 36 times [2019-08-05 10:31:57,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:57,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:31:57,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:58,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:31:58,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:31:58,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:31:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:58,675 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 42 states. [2019-08-05 10:32:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,281 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:32:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:32:00,282 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 10:32:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,283 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:32:00,283 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:32:00,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=1701, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:32:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:32:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 10:32:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:32:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 10:32:00,287 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2019-08-05 10:32:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,288 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 10:32:00,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:32:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 10:32:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:32:00,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,288 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1] [2019-08-05 10:32:00,289 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 19183236, now seen corresponding path program 37 times [2019-08-05 10:32:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 551 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:32:00,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:32:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:32:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:32:00,909 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 42 states. [2019-08-05 10:32:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:01,525 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-05 10:32:01,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:32:01,526 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:32:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:01,527 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:32:01,527 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:32:01,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:32:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:32:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:32:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:32:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:32:01,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 81 [2019-08-05 10:32:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:01,531 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:32:01,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:32:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:32:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:32:01,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:01,532 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2019-08-05 10:32:01,532 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1402257331, now seen corresponding path program 38 times [2019-08-05 10:32:01,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:01,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:32:01,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:02,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:32:02,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:32:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:32:02,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1787, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:02,895 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 44 states. [2019-08-05 10:32:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:04,754 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 10:32:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:04,755 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 10:32:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:04,756 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:32:04,756 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:32:04,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=1870, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:32:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:32:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:32:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-05 10:32:04,759 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 82 [2019-08-05 10:32:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:04,760 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-05 10:32:04,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:32:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-05 10:32:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:32:04,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:04,761 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1] [2019-08-05 10:32:04,761 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1792343652, now seen corresponding path program 39 times [2019-08-05 10:32:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:32:04,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 610 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:32:05,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:32:05,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:32:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:32:05,785 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 44 states. [2019-08-05 10:32:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,407 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 10:32:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:06,407 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:32:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,408 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:32:06,408 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:32:06,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:32:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:32:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:32:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:32:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:32:06,412 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 85 [2019-08-05 10:32:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,412 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:32:06,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:32:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:32:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:32:06,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,413 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2019-08-05 10:32:06,413 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1022001435, now seen corresponding path program 40 times [2019-08-05 10:32:06,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:32:07,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:32:07,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:32:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1960, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:07,918 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 46 states. [2019-08-05 10:32:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,747 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:32:09,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:32:09,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 10:32:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,748 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:32:09,748 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:32:09,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=2047, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:32:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 10:32:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:32:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 10:32:09,752 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2019-08-05 10:32:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,752 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 10:32:09,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:32:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 10:32:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:32:09,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,753 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1] [2019-08-05 10:32:09,753 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash 582294532, now seen corresponding path program 41 times [2019-08-05 10:32:09,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 672 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:10,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:32:10,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:32:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:32:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:10,733 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 46 states. [2019-08-05 10:32:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:11,592 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:32:11,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:32:11,592 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:32:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:11,593 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:32:11,594 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:32:11,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:32:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:32:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:32:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:32:11,597 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-05 10:32:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:11,598 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:32:11,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:32:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:32:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:32:11,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:11,599 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2019-08-05 10:32:11,599 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 824036557, now seen corresponding path program 42 times [2019-08-05 10:32:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:11,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:32:11,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:13,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:13,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:13,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:32:13,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:32:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:32:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=2141, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:13,135 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 48 states. [2019-08-05 10:32:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,114 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:32:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:32:15,115 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 10:32:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,116 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:32:15,116 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:32:15,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=120, Invalid=2232, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:32:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 10:32:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:32:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 10:32:15,120 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 90 [2019-08-05 10:32:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,120 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 10:32:15,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:32:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 10:32:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:32:15,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,121 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1] [2019-08-05 10:32:15,121 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1156111076, now seen corresponding path program 43 times [2019-08-05 10:32:15,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 737 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:16,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:16,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:32:16,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:32:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:32:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:16,357 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 48 states. [2019-08-05 10:32:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,851 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2019-08-05 10:32:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:32:17,861 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:32:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,862 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:32:17,862 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:32:17,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:32:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:32:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:32:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:32:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 10:32:17,865 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 93 [2019-08-05 10:32:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,866 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 10:32:17,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:32:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 10:32:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:32:17,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,867 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2019-08-05 10:32:17,867 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash 280512869, now seen corresponding path program 44 times [2019-08-05 10:32:17,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:17,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:32:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 1013 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:32:19,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:32:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:32:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2330, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:19,305 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 50 states. [2019-08-05 10:32:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:22,299 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:32:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:22,302 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 10:32:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:22,303 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:32:22,303 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:32:22,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=2425, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:32:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 10:32:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:32:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-08-05 10:32:22,306 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2019-08-05 10:32:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:22,306 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-08-05 10:32:22,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:32:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-08-05 10:32:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:32:22,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:22,307 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1] [2019-08-05 10:32:22,307 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1243594364, now seen corresponding path program 45 times [2019-08-05 10:32:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:22,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:32:22,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 805 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:32:23,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:32:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:32:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:23,422 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2019-08-05 10:32:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:24,246 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-05 10:32:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:24,247 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:32:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:24,248 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:32:24,248 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:32:24,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:32:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:32:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:32:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:32:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:32:24,252 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 97 [2019-08-05 10:32:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:24,252 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:32:24,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:32:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:32:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:32:24,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:24,253 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2019-08-05 10:32:24,253 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1381243213, now seen corresponding path program 46 times [2019-08-05 10:32:24,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:24,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:32:24,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:25,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:25,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:25,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:32:25,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:32:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:32:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:25,727 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 52 states. [2019-08-05 10:32:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:28,460 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:32:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:32:28,461 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 10:32:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:28,462 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:32:28,462 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:32:28,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=130, Invalid=2626, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:32:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:32:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 10:32:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:32:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 10:32:28,465 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 98 [2019-08-05 10:32:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:28,466 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 10:32:28,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:32:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 10:32:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:32:28,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:28,467 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1] [2019-08-05 10:32:28,467 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1461221220, now seen corresponding path program 47 times [2019-08-05 10:32:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:28,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:32:28,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 876 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:29,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:32:29,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:32:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:32:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:29,560 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 52 states. [2019-08-05 10:32:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,976 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2019-08-05 10:32:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:32:30,976 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:32:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,977 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:32:30,978 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:32:30,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:32:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:32:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:32:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:32:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:32:30,982 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-08-05 10:32:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,982 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:32:30,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:32:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:32:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:32:30,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,983 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2019-08-05 10:32:30,983 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1264036891, now seen corresponding path program 48 times [2019-08-05 10:32:30,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:31,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:32:31,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:32,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 1201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:32,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:32:32,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:32:32,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:32:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2732, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:32,550 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 54 states. [2019-08-05 10:32:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:35,372 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:32:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:32:35,373 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 10:32:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:35,374 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:32:35,375 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:32:35,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=135, Invalid=2835, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:32:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 10:32:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:32:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 10:32:35,378 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2019-08-05 10:32:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:35,378 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 10:32:35,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:32:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 10:32:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:32:35,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:35,379 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1] [2019-08-05 10:32:35,379 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:35,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1354114820, now seen corresponding path program 49 times [2019-08-05 10:32:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:35,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:32:35,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 950 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:36,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:36,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:32:36,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:32:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:32:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:36,418 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 54 states. [2019-08-05 10:32:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:38,217 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:32:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:32:38,217 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:32:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:38,219 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:32:38,219 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:32:38,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:32:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:32:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:32:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:32:38,222 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 105 [2019-08-05 10:32:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:38,223 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:32:38,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:32:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:32:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:32:38,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:38,223 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2019-08-05 10:32:38,224 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1390533171, now seen corresponding path program 50 times [2019-08-05 10:32:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:38,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:32:38,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:39,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 0 proven. 1301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:39,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:32:39,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:32:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:32:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2945, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:39,858 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 56 states. [2019-08-05 10:32:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,686 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-05 10:32:42,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:32:42,686 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 10:32:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,687 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:32:42,687 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:32:42,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=3052, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:32:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:32:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 10:32:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:32:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-08-05 10:32:42,690 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 106 [2019-08-05 10:32:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,690 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-08-05 10:32:42,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:32:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-08-05 10:32:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:32:42,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,691 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1] [2019-08-05 10:32:42,691 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,692 INFO L82 PathProgramCache]: Analyzing trace with hash -410244068, now seen corresponding path program 51 times [2019-08-05 10:32:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 1027 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:32:44,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:32:44,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:32:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:44,108 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 56 states. [2019-08-05 10:32:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:45,767 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2019-08-05 10:32:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:32:45,767 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 10:32:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:45,768 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:32:45,768 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:32:45,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:32:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:32:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:32:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:32:45,772 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 109 [2019-08-05 10:32:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:45,772 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:32:45,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:32:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:32:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:32:45,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:45,773 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2019-08-05 10:32:45,773 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1093296539, now seen corresponding path program 52 times [2019-08-05 10:32:45,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:45,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:32:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:47,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 0 proven. 1405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:47,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:32:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:32:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=3166, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:47,430 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 58 states. [2019-08-05 10:32:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:50,768 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 10:32:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:50,768 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 10:32:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:50,769 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:32:50,770 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:32:50,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=3277, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:32:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 10:32:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:32:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-08-05 10:32:50,773 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2019-08-05 10:32:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:50,774 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-08-05 10:32:50,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:32:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-08-05 10:32:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:32:50,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:50,774 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1] [2019-08-05 10:32:50,775 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1656304508, now seen corresponding path program 53 times [2019-08-05 10:32:50,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:50,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:32:50,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 1107 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:52,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:52,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:32:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:32:52,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:52,017 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 58 states. [2019-08-05 10:32:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:53,751 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-08-05 10:32:53,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:53,751 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 10:32:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:53,753 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:32:53,753 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:32:53,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:32:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:32:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:32:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:32:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:32:53,755 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2019-08-05 10:32:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:53,756 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:32:53,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:32:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:32:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:32:53,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:53,756 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2019-08-05 10:32:53,756 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:53,757 INFO L82 PathProgramCache]: Analyzing trace with hash -225709491, now seen corresponding path program 54 times [2019-08-05 10:32:53,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:53,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:32:53,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:55,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:32:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 1513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:55,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:55,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:32:55,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:32:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:32:55,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=3395, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:55,625 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 60 states. [2019-08-05 10:32:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:59,093 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 10:32:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:32:59,093 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 10:32:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:59,095 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:32:59,095 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:32:59,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=150, Invalid=3510, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:32:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:32:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 10:32:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:32:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-08-05 10:32:59,098 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 114 [2019-08-05 10:32:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:59,098 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-08-05 10:32:59,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:32:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-08-05 10:32:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:32:59,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:59,099 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1] [2019-08-05 10:32:59,099 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:59,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1811222428, now seen corresponding path program 55 times [2019-08-05 10:32:59,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:59,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:32:59,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1190 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:00,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:33:00,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:33:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:33:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:33:00,383 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 60 states. [2019-08-05 10:33:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:01,912 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2019-08-05 10:33:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:33:01,912 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 10:33:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:01,913 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:33:01,914 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:33:01,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:33:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:33:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:33:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:33:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-05 10:33:01,917 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 117 [2019-08-05 10:33:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:01,917 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-05 10:33:01,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:33:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-05 10:33:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:33:01,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:01,918 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2019-08-05 10:33:01,919 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1422907163, now seen corresponding path program 56 times [2019-08-05 10:33:01,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:01,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:33:01,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:05,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 1625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:05,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:33:05,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:33:05,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:33:05,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=3632, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:05,282 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 62 states. [2019-08-05 10:33:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:09,112 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:33:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:33:09,112 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2019-08-05 10:33:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:09,113 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:33:09,113 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:33:09,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=155, Invalid=3751, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:33:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 10:33:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:33:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-08-05 10:33:09,116 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2019-08-05 10:33:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:09,117 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-08-05 10:33:09,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:33:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-08-05 10:33:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:33:09,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:09,117 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1] [2019-08-05 10:33:09,118 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1503801860, now seen corresponding path program 57 times [2019-08-05 10:33:09,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:09,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:33:09,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 1276 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:10,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:10,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:33:10,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:33:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:33:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:10,417 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 62 states. [2019-08-05 10:33:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:12,385 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2019-08-05 10:33:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:33:12,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 10:33:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:12,387 INFO L225 Difference]: With dead ends: 211 [2019-08-05 10:33:12,387 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:33:12,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:33:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:33:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:33:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:33:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:33:12,391 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 121 [2019-08-05 10:33:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:12,391 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:33:12,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:33:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:33:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:33:12,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:12,392 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2019-08-05 10:33:12,392 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash -408060211, now seen corresponding path program 58 times [2019-08-05 10:33:12,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:12,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:33:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:14,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 0 proven. 1741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:33:14,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:33:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:33:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=3877, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:14,582 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 64 states. [2019-08-05 10:33:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:18,226 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:33:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:33:18,227 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2019-08-05 10:33:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:18,227 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:33:18,227 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:33:18,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=160, Invalid=4000, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:33:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 10:33:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:33:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-08-05 10:33:18,230 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 122 [2019-08-05 10:33:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:18,230 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-08-05 10:33:18,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:33:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-08-05 10:33:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:33:18,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:18,231 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1] [2019-08-05 10:33:18,232 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1760414948, now seen corresponding path program 59 times [2019-08-05 10:33:18,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:18,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:33:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 1365 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:19,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:19,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:33:19,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:33:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:33:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:19,927 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 64 states. [2019-08-05 10:33:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:21,701 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2019-08-05 10:33:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:33:21,701 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 10:33:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:21,702 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:33:21,702 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:33:21,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:33:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:33:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:33:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:33:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 10:33:21,706 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2019-08-05 10:33:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:21,707 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 10:33:21,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:33:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 10:33:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:33:21,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:21,707 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2019-08-05 10:33:21,708 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1638396773, now seen corresponding path program 60 times [2019-08-05 10:33:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:21,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:33:21,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:23,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 1861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:23,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:23,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:33:23,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:33:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:33:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=4130, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:23,921 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 66 states. [2019-08-05 10:33:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:27,998 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 10:33:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:27,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2019-08-05 10:33:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:27,999 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:33:28,000 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:33:28,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=165, Invalid=4257, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:33:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 10:33:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:33:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-08-05 10:33:28,003 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2019-08-05 10:33:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:28,003 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-08-05 10:33:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:33:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-08-05 10:33:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:33:28,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:28,004 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1] [2019-08-05 10:33:28,005 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1473795972, now seen corresponding path program 61 times [2019-08-05 10:33:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:28,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:33:28,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 1457 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:33:29,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:33:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:33:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:29,734 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 66 states. [2019-08-05 10:33:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:31,788 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2019-08-05 10:33:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:31,789 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 10:33:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:31,790 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:33:31,790 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:33:31,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:33:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:33:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:33:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:33:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 10:33:31,794 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 129 [2019-08-05 10:33:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:31,794 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 10:33:31,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:33:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 10:33:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:33:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:31,795 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2019-08-05 10:33:31,795 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1704119117, now seen corresponding path program 62 times [2019-08-05 10:33:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:31,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:33:31,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:34,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 0 proven. 1985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:33:34,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:33:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:33:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:34,354 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 68 states. [2019-08-05 10:33:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:38,641 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-05 10:33:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:33:38,641 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 130 [2019-08-05 10:33:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:38,642 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:33:38,643 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:33:38,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=170, Invalid=4522, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:33:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:33:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 10:33:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:33:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-08-05 10:33:38,647 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 130 [2019-08-05 10:33:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:38,647 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-08-05 10:33:38,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:33:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-08-05 10:33:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:33:38,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:38,648 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1] [2019-08-05 10:33:38,649 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash 903059100, now seen corresponding path program 63 times [2019-08-05 10:33:38,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:38,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:33:38,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 1552 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:42,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:42,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:33:42,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:33:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:33:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:42,462 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 68 states. [2019-08-05 10:33:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,927 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2019-08-05 10:33:43,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:33:43,927 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 10:33:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,928 INFO L225 Difference]: With dead ends: 232 [2019-08-05 10:33:43,928 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:33:43,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:33:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:33:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:33:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 10:33:43,933 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 133 [2019-08-05 10:33:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,933 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 10:33:43,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:33:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 10:33:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:33:43,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,934 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2019-08-05 10:33:43,934 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 908918245, now seen corresponding path program 64 times [2019-08-05 10:33:43,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:46,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 0 proven. 2113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:33:46,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:33:46,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:33:46,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4660, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:46,623 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 70 states. [2019-08-05 10:33:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:51,080 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 10:33:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:33:51,081 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 134 [2019-08-05 10:33:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:51,082 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:33:51,082 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:33:51,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=175, Invalid=4795, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:33:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:33:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 10:33:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:33:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-08-05 10:33:51,084 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2019-08-05 10:33:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:51,085 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-08-05 10:33:51,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:33:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-08-05 10:33:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:33:51,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:51,086 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1] [2019-08-05 10:33:51,086 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2113486084, now seen corresponding path program 65 times [2019-08-05 10:33:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:51,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:33:51,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 1650 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:52,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:52,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:33:52,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:33:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:33:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:52,686 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 70 states. [2019-08-05 10:33:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:54,023 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2019-08-05 10:33:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:33:54,023 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 10:33:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:54,025 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:33:54,025 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:33:54,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:33:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:33:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:33:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:33:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:33:54,028 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2019-08-05 10:33:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:54,028 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:33:54,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:33:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:33:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:33:54,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:54,029 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2019-08-05 10:33:54,029 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1498142669, now seen corresponding path program 66 times [2019-08-05 10:33:54,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:54,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:33:54,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:56,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 2245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:56,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:33:56,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:33:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:33:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=4937, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:33:56,908 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 72 states. [2019-08-05 10:34:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:01,639 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:34:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:34:01,640 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 138 [2019-08-05 10:34:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:01,641 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:34:01,641 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:34:01,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=180, Invalid=5076, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:34:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 10:34:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:34:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-08-05 10:34:01,643 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 138 [2019-08-05 10:34:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:01,644 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-08-05 10:34:01,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:34:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-08-05 10:34:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:34:01,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:01,644 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1] [2019-08-05 10:34:01,644 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:01,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2128004580, now seen corresponding path program 67 times [2019-08-05 10:34:01,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:01,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:34:01,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 1751 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:03,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:03,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:34:03,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:34:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:34:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:03,266 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 72 states. [2019-08-05 10:34:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:05,170 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2019-08-05 10:34:05,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:34:05,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 10:34:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:05,172 INFO L225 Difference]: With dead ends: 246 [2019-08-05 10:34:05,172 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:34:05,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:34:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:34:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:34:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:34:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-05 10:34:05,176 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 141 [2019-08-05 10:34:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:05,176 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-05 10:34:05,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:34:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-05 10:34:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:34:05,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:05,177 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2019-08-05 10:34:05,177 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -391165851, now seen corresponding path program 68 times [2019-08-05 10:34:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:05,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:34:05,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:07,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 0 proven. 2381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:07,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:07,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:07,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=5222, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:07,775 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 74 states. [2019-08-05 10:34:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:13,286 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-05 10:34:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:13,287 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 142 [2019-08-05 10:34:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:13,288 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:34:13,288 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:34:13,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=185, Invalid=5365, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:34:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 10:34:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:34:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-08-05 10:34:13,292 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2019-08-05 10:34:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:13,292 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-08-05 10:34:13,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-08-05 10:34:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:34:13,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:13,293 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1] [2019-08-05 10:34:13,293 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -971709820, now seen corresponding path program 69 times [2019-08-05 10:34:13,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:13,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:34:13,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 1855 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:15,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:15,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:15,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:15,784 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 74 states. [2019-08-05 10:34:16,953 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:34:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:17,542 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2019-08-05 10:34:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:17,543 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 10:34:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:17,544 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:34:17,544 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:34:17,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:34:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:34:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:34:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:34:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:34:17,548 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 145 [2019-08-05 10:34:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:17,548 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:34:17,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:34:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:34:17,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:17,550 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2019-08-05 10:34:17,550 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1008163763, now seen corresponding path program 70 times [2019-08-05 10:34:17,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:17,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:34:17,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:20,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2521 backedges. 0 proven. 2521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:20,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:20,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=5515, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:20,596 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 76 states. [2019-08-05 10:34:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:26,253 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-05 10:34:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:26,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 146 [2019-08-05 10:34:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:26,255 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:34:26,255 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:34:26,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=190, Invalid=5662, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:34:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 10:34:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:34:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-08-05 10:34:26,259 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 146 [2019-08-05 10:34:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:26,259 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-08-05 10:34:26,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-08-05 10:34:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:34:26,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:26,260 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1] [2019-08-05 10:34:26,260 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash 503520668, now seen corresponding path program 71 times [2019-08-05 10:34:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:26,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:34:26,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 1962 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:28,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:28,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:28,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:28,091 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 76 states. [2019-08-05 10:34:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:29,593 INFO L93 Difference]: Finished difference Result 260 states and 261 transitions. [2019-08-05 10:34:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:29,593 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 10:34:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:29,595 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:34:29,595 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:34:29,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:34:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:34:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:34:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:34:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 10:34:29,598 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2019-08-05 10:34:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:29,598 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 10:34:29,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 10:34:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:34:29,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:29,599 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2019-08-05 10:34:29,600 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1524706587, now seen corresponding path program 72 times [2019-08-05 10:34:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:29,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:34:29,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:32,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2665 backedges. 0 proven. 2665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:34:32,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5816, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:32,850 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 78 states. [2019-08-05 10:34:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:39,092 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:34:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:39,093 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 150 [2019-08-05 10:34:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:39,094 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:34:39,094 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:34:39,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=195, Invalid=5967, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:34:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 10:34:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:34:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-08-05 10:34:39,096 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2019-08-05 10:34:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:39,096 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-08-05 10:34:39,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:34:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-08-05 10:34:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:34:39,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:39,098 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1] [2019-08-05 10:34:39,098 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1044072452, now seen corresponding path program 73 times [2019-08-05 10:34:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:39,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:34:39,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 2072 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:41,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:41,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:34:41,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:41,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:41,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:41,276 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 78 states. [2019-08-05 10:34:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:43,419 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2019-08-05 10:34:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:43,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 10:34:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:43,421 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:34:43,421 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:34:43,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:34:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:34:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:34:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:34:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-05 10:34:43,424 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 153 [2019-08-05 10:34:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:43,425 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-05 10:34:43,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:34:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-05 10:34:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:34:43,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:43,425 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2019-08-05 10:34:43,426 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1166462771, now seen corresponding path program 74 times [2019-08-05 10:34:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:34:43,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:46,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:34:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2813 backedges. 0 proven. 2813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:46,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:46,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:34:46,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:34:46,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:34:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=6125, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:34:46,751 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 80 states. [2019-08-05 10:34:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:52,790 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-05 10:34:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:34:52,791 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 154 [2019-08-05 10:34:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:52,792 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:34:52,792 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:34:52,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=200, Invalid=6280, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:34:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:34:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 10:34:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:34:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-08-05 10:34:52,796 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 154 [2019-08-05 10:34:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:52,796 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-08-05 10:34:52,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:34:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-08-05 10:34:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:34:52,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:52,797 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1] [2019-08-05 10:34:52,798 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 491864348, now seen corresponding path program 75 times [2019-08-05 10:34:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:52,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:34:52,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 2185 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:54,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:54,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:34:54,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:34:54,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:34:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:34:54,799 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 80 states. [2019-08-05 10:34:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:57,188 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2019-08-05 10:34:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:34:57,189 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 10:34:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:57,190 INFO L225 Difference]: With dead ends: 274 [2019-08-05 10:34:57,190 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:34:57,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:34:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:34:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 10:34:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:34:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 10:34:57,194 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 157 [2019-08-05 10:34:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:57,194 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 10:34:57,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:34:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 10:34:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:34:57,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:57,195 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2019-08-05 10:34:57,195 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash 57384293, now seen corresponding path program 76 times [2019-08-05 10:34:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:57,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:34:57,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:35:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:35:00,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:35:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:35:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=6442, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:00,347 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 82 states. [2019-08-05 10:35:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:06,975 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:35:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:35:06,975 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2019-08-05 10:35:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:06,976 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:35:06,976 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:35:06,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=205, Invalid=6601, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:35:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 10:35:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:35:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-08-05 10:35:06,980 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2019-08-05 10:35:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:06,980 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-08-05 10:35:06,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:35:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-08-05 10:35:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:35:06,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:06,981 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1] [2019-08-05 10:35:06,981 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash 142372228, now seen corresponding path program 77 times [2019-08-05 10:35:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:07,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:35:07,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 2301 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:09,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:35:09,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:35:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:35:09,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:09,113 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 82 states. [2019-08-05 10:35:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:11,640 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2019-08-05 10:35:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:35:11,641 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 10:35:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:11,642 INFO L225 Difference]: With dead ends: 281 [2019-08-05 10:35:11,642 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:35:11,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:35:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:35:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:35:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:35:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:35:11,645 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2019-08-05 10:35:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:11,645 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:35:11,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:35:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:35:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:35:11,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:11,646 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2019-08-05 10:35:11,646 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1712160077, now seen corresponding path program 78 times [2019-08-05 10:35:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:35:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 0 proven. 3121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:35:15,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:35:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:35:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=6767, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:15,259 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 84 states. [2019-08-05 10:35:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,349 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-05 10:35:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:35:21,350 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 162 [2019-08-05 10:35:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,351 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:35:21,351 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:35:21,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=210, Invalid=6930, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:35:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 10:35:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:35:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-08-05 10:35:21,354 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 162 [2019-08-05 10:35:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,355 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-08-05 10:35:21,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:35:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-08-05 10:35:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:35:21,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,355 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1] [2019-08-05 10:35:21,356 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -66870116, now seen corresponding path program 79 times [2019-08-05 10:35:21,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:35:21,447 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:35:21,447 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:21,451 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:21,451 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:21 BoogieIcfgContainer [2019-08-05 10:35:21,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:21,453 INFO L168 Benchmark]: Toolchain (without parser) took 244925.39 ms. Allocated memory was 141.6 MB in the beginning and 366.5 MB in the end (delta: 224.9 MB). Free memory was 111.1 MB in the beginning and 283.8 MB in the end (delta: -172.7 MB). Peak memory consumption was 341.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:21,453 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:35:21,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:21,454 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 839.3 kB). Peak memory consumption was 839.3 kB. Max. memory is 7.1 GB. [2019-08-05 10:35:21,455 INFO L168 Benchmark]: RCFGBuilder took 500.92 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 95.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:21,456 INFO L168 Benchmark]: TraceAbstraction took 244352.33 ms. Allocated memory was 141.6 MB in the beginning and 366.5 MB in the end (delta: 224.9 MB). Free memory was 94.8 MB in the beginning and 283.8 MB in the end (delta: -189.0 MB). Peak memory consumption was 324.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:21,459 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 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.14 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 839.3 kB). Peak memory consumption was 839.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 500.92 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 95.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244352.33 ms. Allocated memory was 141.6 MB in the beginning and 366.5 MB in the end (delta: 224.9 MB). Free memory was 94.8 MB in the beginning and 283.8 MB in the end (delta: -189.0 MB). Peak memory consumption was 324.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 41,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 244.2s OverallTime, 81 OverallIterations, 41 TraceHistogramMax, 140.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1803 SDtfs, 2078 SDslu, 56545 SDs, 0 SdLazy, 160223 SolverSat, 1006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7460 GetRequests, 3240 SyntacticMatches, 0 SemanticMatches, 4220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32020 ImplicationChecksByTransitivity, 119.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 80 MinimizatonAttempts, 40 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 100.7s InterpolantComputationTime, 6680 NumberOfCodeBlocks, 6680 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 6600 ConstructedInterpolants, 0 QuantifiedInterpolants, 5561940 SizeOfPredicates, 280 NumberOfNonLiveVariables, 16800 ConjunctsInSsa, 5200 ConjunctsInUnsatCore, 80 InterpolantComputations, 1 PerfectInterpolantSequences, 31200/84540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown