java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:45,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:45,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:45,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:45,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:45,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:45,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:45,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:45,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:45,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:45,574 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:45,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:45,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:45,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:45,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:45,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:45,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:45,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:45,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:45,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:45,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:45,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:45,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:45,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:45,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:45,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:45,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:45,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:45,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:45,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:45,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:45,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:45,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:45,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:45,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:45,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:45,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:45,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:45,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:45,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:45,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:45,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:45,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:45,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:45,648 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:45,649 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:45,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl [2019-08-05 10:16:45,650 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl' [2019-08-05 10:16:45,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:45,685 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:45,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:45,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:45,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:45,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:45,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:45,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:45,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:45,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:45,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:45,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:45,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:45,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (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:16:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:45,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:46,108 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:46,108 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:16:46,110 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:46 BoogieIcfgContainer [2019-08-05 10:16:46,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:46,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:46,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:46,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:46,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/2) ... [2019-08-05 10:16:46,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757ed1ec and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:46, skipping insertion in model container [2019-08-05 10:16:46,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:46" (2/2) ... [2019-08-05 10:16:46,118 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bpl [2019-08-05 10:16:46,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:46,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:46,152 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:46,180 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:46,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:46,181 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:46,181 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:46,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:46,182 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:46,182 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:46,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:46,182 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:16:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:16:46,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,208 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2019-08-05 10:16:46,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:46,464 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:16:46,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:46,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:46,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:46,487 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 10:16:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,625 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:16:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:46,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:16:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,636 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:16:46,636 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:16:46,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:16:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:16:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:16:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:16:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:16:46,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:16:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,673 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:16:46,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:16:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:16:46,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,674 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,675 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 206308035, now seen corresponding path program 1 times [2019-08-05 10:16:46,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:46,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:46,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:46,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:46,851 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 10:16:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,930 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:16:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:46,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:16:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,932 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:16:46,932 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:16:46,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:16:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:16:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:16:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:16:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:16:46,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:16:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,937 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:16:46,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:16:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:46,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,938 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,938 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1531170369, now seen corresponding path program 1 times [2019-08-05 10:16:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:47,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:47,073 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-08-05 10:16:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,213 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:16:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:47,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:16:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,214 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:16:47,215 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:16:47,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:16:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:16:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:16:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:16:47,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:16:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,220 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:16:47,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:16:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:16:47,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,221 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:16:47,221 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -505638469, now seen corresponding path program 2 times [2019-08-05 10:16:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:47,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:47,457 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2019-08-05 10:16:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,624 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 10:16:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:47,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 10:16:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,625 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:16:47,626 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:16:47,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:16:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:16:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:16:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:16:47,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-08-05 10:16:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,630 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:16:47,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:16:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:16:47,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,631 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:16:47,631 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1669882193, now seen corresponding path program 3 times [2019-08-05 10:16:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:47,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:47,863 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-08-05 10:16:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,942 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:16:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:47,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 10:16:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,946 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:16:47,946 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:16:47,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:16:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:16:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:16:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:16:47,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 10:16:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,951 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:16:47,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:16:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:16:47,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,953 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:16:47,953 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 70717867, now seen corresponding path program 4 times [2019-08-05 10:16:47,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:16:48,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:16:48,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:16:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:48,116 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-05 10:16:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,424 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:16:48,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:48,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:16:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,425 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:16:48,425 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:16:48,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:16:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:16:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:16:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:16:48,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 10:16:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,429 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:16:48,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:16:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:16:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:16:48,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,431 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-08-05 10:16:48,431 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2045097383, now seen corresponding path program 5 times [2019-08-05 10:16:48,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:48,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:16:48,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:16:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:48,663 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2019-08-05 10:16:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,803 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 10:16:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:16:48,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-08-05 10:16:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,806 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:16:48,806 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:16:48,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:16:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:16:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:16:48,812 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2019-08-05 10:16:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,812 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:16:48,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:16:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:16:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:16:48,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,813 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2019-08-05 10:16:48,814 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash 37022875, now seen corresponding path program 6 times [2019-08-05 10:16:48,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:49,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:16:49,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:16:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:16:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:16:49,056 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-08-05 10:16:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:49,181 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:16:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:16:49,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-05 10:16:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:49,183 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:16:49,183 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:16:49,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:16:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:16:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:16:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:16:49,187 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 10:16:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:49,188 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:16:49,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:16:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:16:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:16:49,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:49,189 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2019-08-05 10:16:49,189 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1480612969, now seen corresponding path program 7 times [2019-08-05 10:16:49,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:49,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:16:49,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:49,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:16:49,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:16:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:16:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:49,607 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2019-08-05 10:16:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:49,798 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:16:49,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:16:49,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-05 10:16:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:49,799 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:16:49,799 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:16:49,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:16:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:16:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:16:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:16:49,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-05 10:16:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:49,803 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:16:49,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:16:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:16:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:16:49,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:49,805 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2019-08-05 10:16:49,805 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 360221587, now seen corresponding path program 8 times [2019-08-05 10:16:49,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:49,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:16:49,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:16:49,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:16:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:16:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:49,965 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2019-08-05 10:16:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:50,178 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 10:16:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:16:50,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:16:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:50,180 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:16:50,180 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:16:50,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:16:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:16:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:16:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:16:50,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-08-05 10:16:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:50,193 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:16:50,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:16:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:16:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:16:50,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:50,194 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2019-08-05 10:16:50,195 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1263725703, now seen corresponding path program 9 times [2019-08-05 10:16:50,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:50,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:16:50,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:50,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:50,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:16:50,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:16:50,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:16:50,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:50,762 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 15 states. [2019-08-05 10:16:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,184 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:16:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:16:51,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-08-05 10:16:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,186 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:16:51,187 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:16:51,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:16:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:16:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:16:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:16:51,191 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-05 10:16:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,192 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:16:51,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:16:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:16:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:16:51,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,193 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2019-08-05 10:16:51,194 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1629808515, now seen corresponding path program 10 times [2019-08-05 10:16:51,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:51,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:16:51,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:16:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:16:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:51,546 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-08-05 10:16:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,722 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 10:16:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:16:51,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-05 10:16:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,724 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:16:51,724 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:16:51,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:16:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:16:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:16:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:16:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:16:51,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-05 10:16:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,729 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:16:51,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:16:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:16:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:16:51,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,731 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2019-08-05 10:16:51,731 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1248072575, now seen corresponding path program 11 times [2019-08-05 10:16:51,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:52,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:52,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:16:52,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:16:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:16:52,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:52,105 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2019-08-05 10:16:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:52,409 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 10:16:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:16:52,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-08-05 10:16:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:52,411 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:16:52,411 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:16:52,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:16:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:16:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:16:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:16:52,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2019-08-05 10:16:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:52,416 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:16:52,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:16:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:16:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:16:52,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:52,417 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2019-08-05 10:16:52,417 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1910464909, now seen corresponding path program 12 times [2019-08-05 10:16:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:52,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:16:52,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 88 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:52,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:52,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:16:52,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:16:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:16:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:16:52,829 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-08-05 10:16:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:53,438 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:16:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:16:53,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-08-05 10:16:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:53,439 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:16:53,440 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:16:53,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:16:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:16:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:16:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:16:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:16:53,444 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-05 10:16:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:53,445 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:16:53,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:16:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:16:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:16:53,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:53,446 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2019-08-05 10:16:53,447 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:53,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash 179690863, now seen corresponding path program 13 times [2019-08-05 10:16:53,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:53,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:16:53,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:53,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:16:53,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:16:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:16:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:53,861 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2019-08-05 10:16:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,091 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:16:54,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:16:54,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-05 10:16:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,092 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:16:54,092 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:16:54,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:16:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:16:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:16:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:16:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:16:54,096 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 10:16:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,097 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:16:54,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:16:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:16:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:16:54,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,098 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2019-08-05 10:16:54,098 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1225306773, now seen corresponding path program 14 times [2019-08-05 10:16:54,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:54,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:54,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:54,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:16:54,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:16:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:16:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:16:54,381 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2019-08-05 10:16:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,599 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 10:16:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:16:54,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-08-05 10:16:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,600 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:16:54,600 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:16:54,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:16:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:16:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:16:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:16:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:16:54,605 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-08-05 10:16:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,606 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:16:54,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:16:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:16:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:16:54,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,607 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2019-08-05 10:16:54,607 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1452473761, now seen corresponding path program 15 times [2019-08-05 10:16:54,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 130 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:55,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:55,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:16:55,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:16:55,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:16:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:16:55,319 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 23 states. [2019-08-05 10:16:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:55,802 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:16:55,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:16:55,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-08-05 10:16:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:55,803 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:16:55,803 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:16:55,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:16:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:16:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:16:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:16:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:16:55,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 10:16:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:55,807 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:16:55,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:16:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:16:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:16:55,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:55,809 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2019-08-05 10:16:55,809 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1195476315, now seen corresponding path program 16 times [2019-08-05 10:16:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:55,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:16:55,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:56,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:16:56,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:16:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:16:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:16:56,269 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2019-08-05 10:16:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:56,660 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 10:16:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:16:56,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-05 10:16:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:56,661 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:16:56,662 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:16:56,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:16:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:16:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:16:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:16:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 10:16:56,666 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-05 10:16:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:56,667 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 10:16:56,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:16:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 10:16:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:16:56,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:56,668 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2019-08-05 10:16:56,669 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1040107177, now seen corresponding path program 17 times [2019-08-05 10:16:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:56,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:16:56,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:56,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:16:56,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:16:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:16:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:56,942 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 16 states. [2019-08-05 10:16:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:57,239 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:16:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:16:57,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-08-05 10:16:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:57,241 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:16:57,241 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:16:57,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:16:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:16:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:16:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:16:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:16:57,246 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2019-08-05 10:16:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:57,246 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:16:57,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:16:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:16:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:16:57,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:57,248 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2019-08-05 10:16:57,248 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 75962443, now seen corresponding path program 18 times [2019-08-05 10:16:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:57,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:16:57,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 180 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:58,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:58,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:16:58,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:16:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:16:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:16:58,541 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 27 states. [2019-08-05 10:16:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,802 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:16:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:16:58,802 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-08-05 10:16:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,803 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:16:58,803 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:16:58,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:16:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:16:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:16:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:16:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:16:58,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-05 10:16:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,807 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:16:58,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:16:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:16:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:58,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,808 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2019-08-05 10:16:58,809 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1108795207, now seen corresponding path program 19 times [2019-08-05 10:16:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:59,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:59,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:16:59,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:16:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:16:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:16:59,299 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2019-08-05 10:16:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:59,652 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 10:16:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:16:59,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-05 10:16:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:59,653 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:16:59,654 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:16:59,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:16:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:16:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:16:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:16:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:16:59,657 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-05 10:16:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:59,657 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:16:59,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:16:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:16:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:16:59,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:59,658 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2019-08-05 10:16:59,658 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1523636035, now seen corresponding path program 20 times [2019-08-05 10:16:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:59,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:16:59,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:59,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:00,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:00,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:17:00,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:17:00,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:17:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:00,001 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2019-08-05 10:17:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:00,285 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-08-05 10:17:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:17:00,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-08-05 10:17:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:00,289 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:17:00,289 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:17:00,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:17:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:17:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:17:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 10:17:00,294 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2019-08-05 10:17:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:00,294 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 10:17:00,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:17:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 10:17:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:17:00,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:00,295 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2019-08-05 10:17:00,296 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1329455159, now seen corresponding path program 21 times [2019-08-05 10:17:00,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:00,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:17:00,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 238 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:01,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:17:01,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:17:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:17:01,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:01,533 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 31 states. [2019-08-05 10:17:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:01,828 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:17:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:17:01,828 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-08-05 10:17:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:01,829 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:17:01,829 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:17:01,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=584, Invalid=1396, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:17:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:17:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:17:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:17:01,833 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-05 10:17:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:01,833 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:17:01,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:17:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:17:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:17:01,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:01,834 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2019-08-05 10:17:01,834 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1862593331, now seen corresponding path program 22 times [2019-08-05 10:17:01,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:01,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:17:01,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:17:03,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:17:03,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:17:03,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:03,027 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2019-08-05 10:17:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:03,365 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:17:03,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:17:03,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-05 10:17:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:03,366 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:17:03,366 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:17:03,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:17:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:17:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:17:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:17:03,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 10:17:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:03,370 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:17:03,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:17:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:17:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:17:03,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:03,371 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2019-08-05 10:17:03,371 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1187698897, now seen corresponding path program 23 times [2019-08-05 10:17:03,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:03,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:17:03,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:17:03,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:17:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:17:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:03,791 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 20 states. [2019-08-05 10:17:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,122 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 10:17:04,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:17:04,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-08-05 10:17:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,124 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:17:04,124 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:17:04,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:17:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:17:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:17:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:17:04,127 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2019-08-05 10:17:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,128 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:17:04,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:17:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:17:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:17:04,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,128 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2019-08-05 10:17:04,129 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1105222179, now seen corresponding path program 24 times [2019-08-05 10:17:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 304 proven. 272 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:17:04,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:17:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:17:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:04,637 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 35 states. [2019-08-05 10:17:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,093 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:17:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:17:05,094 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-08-05 10:17:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,094 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:17:05,095 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:17:05,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=747, Invalid=1803, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:17:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:17:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:17:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:17:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:17:05,099 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 10:17:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,099 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:17:05,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:17:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:17:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:17:05,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,100 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2019-08-05 10:17:05,101 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1247455519, now seen corresponding path program 25 times [2019-08-05 10:17:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:17:05,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:17:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:17:05,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:05,749 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2019-08-05 10:17:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,321 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-05 10:17:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:17:06,321 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-05 10:17:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,322 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:17:06,323 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:17:06,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=836, Invalid=2026, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:17:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:17:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:17:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:17:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 10:17:06,326 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-05 10:17:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,327 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 10:17:06,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:17:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 10:17:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:17:06,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,328 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2019-08-05 10:17:06,328 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 494741787, now seen corresponding path program 26 times [2019-08-05 10:17:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:07,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:07,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:17:07,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:17:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:17:07,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:07,029 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2019-08-05 10:17:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:08,286 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 10:17:08,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:17:08,286 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2019-08-05 10:17:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:08,287 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:17:08,288 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:17:08,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:17:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:17:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:17:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:17:08,290 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2019-08-05 10:17:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:08,291 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:17:08,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:17:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:17:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:17:08,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:08,291 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2019-08-05 10:17:08,291 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1564313103, now seen corresponding path program 27 times [2019-08-05 10:17:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:08,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:17:08,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 378 proven. 342 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:08,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:17:08,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:17:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:17:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:08,895 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 39 states. [2019-08-05 10:17:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,331 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 10:17:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:17:09,331 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 80 [2019-08-05 10:17:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,332 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:17:09,333 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:17:09,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=930, Invalid=2262, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:17:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:17:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:17:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:17:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:17:09,336 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-05 10:17:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,336 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:17:09,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:17:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:17:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:17:09,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,337 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2019-08-05 10:17:09,337 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash 417798411, now seen corresponding path program 28 times [2019-08-05 10:17:09,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:17:10,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:17:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:17:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:10,085 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2019-08-05 10:17:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:10,826 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:17:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:17:10,826 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-05 10:17:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:10,827 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:17:10,827 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:17:10,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1029, Invalid=2511, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:17:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:17:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:17:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:17:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:17:10,831 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-05 10:17:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:10,832 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:17:10,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:17:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:17:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:17:10,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:10,832 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2019-08-05 10:17:10,833 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1871192825, now seen corresponding path program 29 times [2019-08-05 10:17:10,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:10,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:17:10,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:11,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:11,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:11,860 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 24 states. [2019-08-05 10:17:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:12,295 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-08-05 10:17:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:17:12,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2019-08-05 10:17:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:12,297 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:17:12,297 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:17:12,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:17:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:17:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:17:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 10:17:12,301 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2019-08-05 10:17:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:12,301 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 10:17:12,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 10:17:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:17:12,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:12,302 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2019-08-05 10:17:12,302 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1432067077, now seen corresponding path program 30 times [2019-08-05 10:17:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:12,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:17:12,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 460 proven. 420 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:17:13,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:17:13,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:17:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:13,032 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 43 states. [2019-08-05 10:17:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:13,520 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 10:17:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:17:13,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-08-05 10:17:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:13,522 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:17:13,522 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:17:13,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1133, Invalid=2773, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:17:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:17:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:17:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:17:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:17:13,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-05 10:17:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:13,526 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:17:13,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:17:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:17:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:17:13,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:13,527 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2019-08-05 10:17:13,527 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1476838665, now seen corresponding path program 31 times [2019-08-05 10:17:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:13,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:17:13,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:14,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:17:14,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:17:14,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:17:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:14,575 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2019-08-05 10:17:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:15,131 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-05 10:17:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:17:15,131 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-05 10:17:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:15,132 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:17:15,132 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:17:15,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:17:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:17:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:17:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:17:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:17:15,137 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 10:17:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:15,138 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:17:15,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:17:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:17:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:17:15,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:15,139 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2019-08-05 10:17:15,139 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1552661773, now seen corresponding path program 32 times [2019-08-05 10:17:15,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:15,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:15,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:15,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:15,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:15,524 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2019-08-05 10:17:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:15,990 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 10:17:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:17:15,991 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2019-08-05 10:17:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:15,992 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:17:15,992 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:17:15,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:17:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:17:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:17:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:17:15,996 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2019-08-05 10:17:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:17:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:17:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:17:15,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:15,997 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2019-08-05 10:17:15,998 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2078536679, now seen corresponding path program 33 times [2019-08-05 10:17:15,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:16,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:17:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 550 proven. 506 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:17,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:17,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:17:17,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:17:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:17:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:17,178 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 47 states. [2019-08-05 10:17:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:17,781 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:17:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:17:17,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 96 [2019-08-05 10:17:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:17,783 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:17:17,783 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:17:17,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1356, Invalid=3336, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:17:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:17:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:17:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:17:17,786 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 10:17:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:17,787 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:17:17,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:17:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:17:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:17:17,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:17,788 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2019-08-05 10:17:17,788 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash 224399075, now seen corresponding path program 34 times [2019-08-05 10:17:17,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:17,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:17:17,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:18,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:18,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:17:18,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:17:18,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:17:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:18,781 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2019-08-05 10:17:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:19,438 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-05 10:17:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:17:19,439 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-05 10:17:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:19,440 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:17:19,440 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:17:19,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1475, Invalid=3637, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:17:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:17:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:17:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:17:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 10:17:19,444 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-05 10:17:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:19,444 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 10:17:19,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:17:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 10:17:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:17:19,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:19,444 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2019-08-05 10:17:19,445 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 809589471, now seen corresponding path program 35 times [2019-08-05 10:17:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:19,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:17:19,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:17:20,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:17:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:17:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:20,033 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 28 states. [2019-08-05 10:17:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:20,513 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 10:17:20,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:17:20,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2019-08-05 10:17:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:20,515 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:17:20,515 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:17:20,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:17:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:17:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:17:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:17:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:17:20,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2019-08-05 10:17:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:20,519 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:17:20,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:17:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:17:20,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:20,520 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2019-08-05 10:17:20,520 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 726349267, now seen corresponding path program 36 times [2019-08-05 10:17:20,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:20,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:17:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 648 proven. 600 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:21,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:21,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:17:21,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:17:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:17:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:17:21,825 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 51 states. [2019-08-05 10:17:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:22,449 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:17:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:17:22,449 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2019-08-05 10:17:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:22,450 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:17:22,450 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:17:22,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1599, Invalid=3951, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:17:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:17:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:17:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:17:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:17:22,453 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-05 10:17:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:22,453 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:17:22,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:17:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:17:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:17:22,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:22,454 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2019-08-05 10:17:22,455 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1735038159, now seen corresponding path program 37 times [2019-08-05 10:17:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:22,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:17:22,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:23,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:23,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:17:23,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:17:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:17:23,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:17:23,872 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2019-08-05 10:17:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:24,561 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-05 10:17:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:17:24,562 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-05 10:17:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:24,563 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:17:24,563 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:17:24,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1728, Invalid=4278, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:17:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:17:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:17:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:17:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:17:24,567 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-05 10:17:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:24,567 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:17:24,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:17:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:17:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:17:24,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:24,568 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2019-08-05 10:17:24,568 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 422454475, now seen corresponding path program 38 times [2019-08-05 10:17:24,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:24,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:17:24,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:24,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:24,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:24,990 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2019-08-05 10:17:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:25,576 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-08-05 10:17:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:17:25,576 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2019-08-05 10:17:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:25,577 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:17:25,577 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:17:25,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:17:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:17:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:17:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:17:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-05 10:17:25,580 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2019-08-05 10:17:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:25,581 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-05 10:17:25,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-05 10:17:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:17:25,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:25,582 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2019-08-05 10:17:25,582 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash -609670721, now seen corresponding path program 39 times [2019-08-05 10:17:25,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:17:25,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 754 proven. 702 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:17:27,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:17:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:17:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:17:27,072 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 55 states. [2019-08-05 10:17:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:28,317 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-05 10:17:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:17:28,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 112 [2019-08-05 10:17:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:28,319 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:17:28,319 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:17:28,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1862, Invalid=4618, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:17:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:17:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:17:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:17:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:17:28,323 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-05 10:17:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:28,323 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:17:28,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:17:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:17:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:17:28,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:28,324 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2019-08-05 10:17:28,325 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1662530373, now seen corresponding path program 40 times [2019-08-05 10:17:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:28,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:17:28,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:17:29,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:17:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:17:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:17:29,605 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2019-08-05 10:17:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:30,574 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-08-05 10:17:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:17:30,575 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2019-08-05 10:17:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:30,576 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:17:30,576 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:17:30,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2001, Invalid=4971, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:17:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:17:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:17:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:17:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 10:17:30,578 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 10:17:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:30,579 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 10:17:30,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:17:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 10:17:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:17:30,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:30,579 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2019-08-05 10:17:30,579 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash 151625911, now seen corresponding path program 41 times [2019-08-05 10:17:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:30,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:17:30,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:31,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:31,187 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 32 states. [2019-08-05 10:17:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,016 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-08-05 10:17:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:17:32,016 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116 [2019-08-05 10:17:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,017 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:17:32,018 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:17:32,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:17:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:17:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:17:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:17:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 10:17:32,022 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2019-08-05 10:17:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,022 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 10:17:32,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 10:17:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:17:32,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,023 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2019-08-05 10:17:32,023 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 944557995, now seen corresponding path program 42 times [2019-08-05 10:17:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 868 proven. 812 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:33,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:17:33,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:17:33,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:17:33,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:17:33,275 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 59 states. [2019-08-05 10:17:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:34,419 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-08-05 10:17:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:17:34,419 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 120 [2019-08-05 10:17:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:34,421 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:17:34,421 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:17:34,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=5337, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:17:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:17:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:17:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:17:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:17:34,424 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 10:17:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:34,424 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:17:34,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:17:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:17:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:17:34,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:34,425 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2019-08-05 10:17:34,426 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 489076391, now seen corresponding path program 43 times [2019-08-05 10:17:34,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:34,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:17:34,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:36,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:17:36,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:17:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:17:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:17:36,555 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2019-08-05 10:17:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,550 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:17:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:17:37,550 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2019-08-05 10:17:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,552 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:17:37,552 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:17:37,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2294, Invalid=5716, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:17:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:17:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:17:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:17:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-05 10:17:37,555 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-05 10:17:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,555 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-05 10:17:37,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:17:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-05 10:17:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:17:37,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,556 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2019-08-05 10:17:37,557 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 857919139, now seen corresponding path program 44 times [2019-08-05 10:17:37,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:38,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:38,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:38,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:17:38,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:17:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:17:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:38,174 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 34 states. [2019-08-05 10:17:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,813 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-05 10:17:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:17:38,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2019-08-05 10:17:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,814 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:17:38,814 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:17:38,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:17:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:17:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:17:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 10:17:38,818 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2019-08-05 10:17:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,818 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 10:17:38,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:17:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 10:17:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:17:38,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,818 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2019-08-05 10:17:38,819 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash 889530263, now seen corresponding path program 45 times [2019-08-05 10:17:38,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 990 proven. 930 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:17:40,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:17:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:17:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:17:40,455 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 63 states. [2019-08-05 10:17:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:41,352 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-08-05 10:17:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:17:41,352 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2019-08-05 10:17:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:41,353 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:17:41,353 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:17:41,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2448, Invalid=6108, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:17:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:17:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:17:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:17:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 10:17:41,357 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-05 10:17:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:41,357 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 10:17:41,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:17:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 10:17:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:17:41,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:41,358 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2019-08-05 10:17:41,358 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1611246957, now seen corresponding path program 46 times [2019-08-05 10:17:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:41,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:17:41,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:17:43,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:17:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:17:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:43,239 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2019-08-05 10:17:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:44,214 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-08-05 10:17:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:17:44,215 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2019-08-05 10:17:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:44,216 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:17:44,216 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:17:44,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2607, Invalid=6513, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:17:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:17:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:17:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:17:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 10:17:44,220 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-05 10:17:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:44,220 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 10:17:44,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:17:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 10:17:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:17:44,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:44,221 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2019-08-05 10:17:44,221 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 323530383, now seen corresponding path program 47 times [2019-08-05 10:17:44,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:44,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:17:44,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:45,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:45,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:45,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:17:45,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:17:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:17:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:45,115 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 36 states. [2019-08-05 10:17:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,835 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-08-05 10:17:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:17:45,835 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2019-08-05 10:17:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,837 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:17:45,837 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:17:45,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:17:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-08-05 10:17:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:17:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-05 10:17:45,840 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2019-08-05 10:17:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,841 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-05 10:17:45,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:17:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-05 10:17:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:17:45,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,842 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2019-08-05 10:17:45,842 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -836685437, now seen corresponding path program 48 times [2019-08-05 10:17:45,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:45,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:17:45,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1120 proven. 1056 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:48,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:48,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:17:48,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:17:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:17:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:17:48,507 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 67 states. [2019-08-05 10:17:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:49,539 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-05 10:17:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:17:49,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 136 [2019-08-05 10:17:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:49,541 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:17:49,541 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:17:49,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2771, Invalid=6931, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:17:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:17:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:17:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:17:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:17:49,544 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-05 10:17:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:49,544 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:17:49,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:17:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:17:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:17:49,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:49,545 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2019-08-05 10:17:49,545 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:49,546 INFO L82 PathProgramCache]: Analyzing trace with hash -442130305, now seen corresponding path program 49 times [2019-08-05 10:17:49,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:49,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:17:49,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:51,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:51,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:17:51,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:17:51,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:17:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:51,338 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2019-08-05 10:17:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:52,640 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-08-05 10:17:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:17:52,640 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2019-08-05 10:17:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:52,641 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:17:52,642 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:17:52,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2940, Invalid=7362, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:17:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:17:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:17:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:17:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 10:17:52,645 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 10:17:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:52,645 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 10:17:52,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:17:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 10:17:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:17:52,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:52,646 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2019-08-05 10:17:52,647 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 768229499, now seen corresponding path program 50 times [2019-08-05 10:17:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:52,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:17:52,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:17:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:53,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:17:53,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:17:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:17:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:53,846 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2019-08-05 10:17:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:54,730 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2019-08-05 10:17:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:17:54,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2019-08-05 10:17:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:54,732 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:17:54,732 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:17:54,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:17:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-08-05 10:17:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:17:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 10:17:54,735 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2019-08-05 10:17:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:54,736 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 10:17:54,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:17:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 10:17:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:17:54,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:54,737 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2019-08-05 10:17:54,737 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -932188817, now seen corresponding path program 51 times [2019-08-05 10:17:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:54,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:17:54,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1258 proven. 1190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:17:56,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:56,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:17:56,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:17:56,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:17:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:17:56,505 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 71 states. [2019-08-05 10:17:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:57,710 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2019-08-05 10:17:57,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:17:57,711 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 144 [2019-08-05 10:17:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:57,712 INFO L225 Difference]: With dead ends: 215 [2019-08-05 10:17:57,712 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:17:57,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3114, Invalid=7806, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:17:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:17:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:17:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:17:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:17:57,714 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-05 10:17:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:57,715 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:17:57,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:17:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:17:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:17:57,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:57,715 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2019-08-05 10:17:57,716 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1996726379, now seen corresponding path program 52 times [2019-08-05 10:17:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:57,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:17:57,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:17:59,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:17:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:17:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:59,455 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2019-08-05 10:18:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:00,673 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2019-08-05 10:18:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:18:00,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2019-08-05 10:18:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:00,675 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:18:00,675 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:18:00,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3293, Invalid=8263, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:18:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:18:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:18:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:18:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-05 10:18:00,678 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-08-05 10:18:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:00,678 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-05 10:18:00,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:18:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-05 10:18:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:18:00,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:00,679 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2019-08-05 10:18:00,679 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash -814316441, now seen corresponding path program 53 times [2019-08-05 10:18:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:00,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:18:00,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:01,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:01,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:01,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:01,412 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 40 states. [2019-08-05 10:18:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,276 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-08-05 10:18:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:18:02,276 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 148 [2019-08-05 10:18:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,278 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:18:02,278 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:18:02,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:18:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-05 10:18:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:18:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 10:18:02,281 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2019-08-05 10:18:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,281 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 10:18:02,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 10:18:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:18:02,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,282 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2019-08-05 10:18:02,283 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1900043099, now seen corresponding path program 54 times [2019-08-05 10:18:02,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1404 proven. 1332 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:04,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:04,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:18:04,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:18:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:18:04,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:04,215 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 75 states. [2019-08-05 10:18:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:05,406 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2019-08-05 10:18:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:18:05,406 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 152 [2019-08-05 10:18:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:05,408 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:18:05,408 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:18:05,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3477, Invalid=8733, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:18:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:18:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:18:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:18:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-05 10:18:05,411 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-08-05 10:18:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:05,411 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-05 10:18:05,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:18:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-05 10:18:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:18:05,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:05,412 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2019-08-05 10:18:05,412 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1700745815, now seen corresponding path program 55 times [2019-08-05 10:18:05,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:07,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:18:07,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:18:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:18:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:07,408 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2019-08-05 10:18:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:08,981 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2019-08-05 10:18:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:18:08,981 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2019-08-05 10:18:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:08,982 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:18:08,982 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:18:08,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3666, Invalid=9216, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:18:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:18:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:18:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:18:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 10:18:08,985 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-08-05 10:18:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:08,985 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 10:18:08,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:18:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 10:18:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:18:08,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:08,986 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2019-08-05 10:18:08,987 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash -845383085, now seen corresponding path program 56 times [2019-08-05 10:18:08,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:09,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:18:09,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:10,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:10,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:10,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:10,098 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 42 states. [2019-08-05 10:18:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,981 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2019-08-05 10:18:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:18:10,981 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2019-08-05 10:18:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,982 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:18:10,982 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:18:10,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:18:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:18:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-08-05 10:18:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:18:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-08-05 10:18:10,986 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2019-08-05 10:18:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,987 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-08-05 10:18:10,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:18:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-08-05 10:18:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:18:10,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,988 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2019-08-05 10:18:10,988 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1583446855, now seen corresponding path program 57 times [2019-08-05 10:18:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:11,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:18:11,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1558 proven. 1482 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:13,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:18:13,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:18:13,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:18:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:13,230 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 79 states. [2019-08-05 10:18:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,559 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2019-08-05 10:18:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:18:14,560 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2019-08-05 10:18:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,561 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:18:14,561 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:18:14,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3860, Invalid=9712, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:18:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:18:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:18:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:18:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:18:14,564 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-08-05 10:18:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,564 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:18:14,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:18:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:18:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:18:14,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,565 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2019-08-05 10:18:14,565 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash 176666179, now seen corresponding path program 58 times [2019-08-05 10:18:14,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:16,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:16,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:18:16,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:18:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:18:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:18:16,784 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2019-08-05 10:18:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:18,437 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2019-08-05 10:18:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:18:18,437 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2019-08-05 10:18:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:18,438 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:18:18,438 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:18:18,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4059, Invalid=10221, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:18:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:18:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-05 10:18:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:18:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-05 10:18:18,442 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-05 10:18:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:18,442 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-05 10:18:18,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:18:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-05 10:18:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:18:18,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:18,443 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2019-08-05 10:18:18,443 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1175134783, now seen corresponding path program 59 times [2019-08-05 10:18:18,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:18,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:18:18,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:19,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:18:19,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:18:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:18:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:19,279 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 44 states. [2019-08-05 10:18:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:20,259 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2019-08-05 10:18:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:18:20,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 164 [2019-08-05 10:18:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:20,261 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:18:20,261 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:18:20,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:18:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:18:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-08-05 10:18:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:18:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-08-05 10:18:20,265 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2019-08-05 10:18:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:20,265 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-08-05 10:18:20,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:18:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-08-05 10:18:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:18:20,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:20,266 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2019-08-05 10:18:20,267 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash 773999923, now seen corresponding path program 60 times [2019-08-05 10:18:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:20,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:18:20,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1720 proven. 1640 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:18:22,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:18:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:18:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:18:22,551 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 83 states. [2019-08-05 10:18:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,190 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2019-08-05 10:18:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:18:24,190 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 168 [2019-08-05 10:18:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,192 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:18:24,192 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:18:24,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4263, Invalid=10743, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:18:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:18:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-05 10:18:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:18:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-08-05 10:18:24,196 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-08-05 10:18:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,196 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-08-05 10:18:24,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:18:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-08-05 10:18:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:18:24,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,197 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2019-08-05 10:18:24,197 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash -926168017, now seen corresponding path program 61 times [2019-08-05 10:18:24,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:26,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:26,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:18:26,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:18:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:18:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:18:26,573 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2019-08-05 10:18:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,314 INFO L93 Difference]: Finished difference Result 255 states and 256 transitions. [2019-08-05 10:18:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:18:28,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2019-08-05 10:18:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,315 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:18:28,315 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:18:28,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4472, Invalid=11278, Unknown=0, NotChecked=0, Total=15750 [2019-08-05 10:18:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:18:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-05 10:18:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:18:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-08-05 10:18:28,319 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-08-05 10:18:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,319 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-08-05 10:18:28,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:18:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-08-05 10:18:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:18:28,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,320 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2019-08-05 10:18:28,321 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1594981419, now seen corresponding path program 62 times [2019-08-05 10:18:28,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:18:29,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:18:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:18:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:18:29,324 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 46 states. [2019-08-05 10:18:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,401 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2019-08-05 10:18:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:18:30,401 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 172 [2019-08-05 10:18:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,403 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:18:30,403 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:18:30,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:18:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:18:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-08-05 10:18:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:18:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-08-05 10:18:30,407 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2019-08-05 10:18:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,407 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-08-05 10:18:30,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:18:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-08-05 10:18:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:18:30,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,408 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2019-08-05 10:18:30,409 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1196544287, now seen corresponding path program 63 times [2019-08-05 10:18:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1890 proven. 1806 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:33,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:33,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:18:33,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:18:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:18:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:18:33,914 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 87 states. [2019-08-05 10:18:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:35,402 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2019-08-05 10:18:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:18:35,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 176 [2019-08-05 10:18:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:35,404 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:18:35,404 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:18:35,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2584 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4686, Invalid=11826, Unknown=0, NotChecked=0, Total=16512 [2019-08-05 10:18:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:18:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-05 10:18:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:18:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-08-05 10:18:35,408 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-08-05 10:18:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:35,408 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-08-05 10:18:35,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:18:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-08-05 10:18:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:18:35,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:35,409 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2019-08-05 10:18:35,410 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -889547749, now seen corresponding path program 64 times [2019-08-05 10:18:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:35,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:18:35,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:38,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:18:38,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:18:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:18:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:18:38,040 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2019-08-05 10:18:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:39,912 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2019-08-05 10:18:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:18:39,912 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2019-08-05 10:18:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:39,914 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:18:39,914 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:18:39,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4905, Invalid=12387, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:18:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:18:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-05 10:18:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 10:18:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-08-05 10:18:39,918 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-08-05 10:18:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:39,918 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-08-05 10:18:39,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:18:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-08-05 10:18:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:18:39,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:39,919 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2019-08-05 10:18:39,919 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 125732887, now seen corresponding path program 65 times [2019-08-05 10:18:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:40,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:40,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:40,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:18:40,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:18:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:18:40,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:18:40,958 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 48 states. [2019-08-05 10:18:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:42,136 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2019-08-05 10:18:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:18:42,137 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-08-05 10:18:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:42,138 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:18:42,138 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:18:42,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:18:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:18:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-08-05 10:18:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:18:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-08-05 10:18:42,142 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2019-08-05 10:18:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:42,142 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-08-05 10:18:42,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:18:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-08-05 10:18:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:18:42,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:42,143 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2019-08-05 10:18:42,144 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922677, now seen corresponding path program 66 times [2019-08-05 10:18:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:42,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:18:42,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2068 proven. 1980 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:45,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:45,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:18:45,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:18:45,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:18:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:18:45,146 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 91 states. [2019-08-05 10:18:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:46,786 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2019-08-05 10:18:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:18:46,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 184 [2019-08-05 10:18:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:46,788 INFO L225 Difference]: With dead ends: 275 [2019-08-05 10:18:46,788 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:18:46,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2839 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5129, Invalid=12961, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:18:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:18:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-05 10:18:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:18:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-08-05 10:18:46,792 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-08-05 10:18:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:46,793 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-08-05 10:18:46,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:18:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-08-05 10:18:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-05 10:18:46,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:46,794 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2019-08-05 10:18:46,794 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1000141305, now seen corresponding path program 67 times [2019-08-05 10:18:46,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:46,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:18:46,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:49,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:18:49,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:18:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:18:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:18:49,849 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2019-08-05 10:18:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:51,604 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2019-08-05 10:18:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:18:51,604 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2019-08-05 10:18:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:51,605 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:18:51,605 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:18:51,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5358, Invalid=13548, Unknown=0, NotChecked=0, Total=18906 [2019-08-05 10:18:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:18:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-05 10:18:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:18:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-08-05 10:18:51,609 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-08-05 10:18:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:51,609 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-08-05 10:18:51,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:18:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-08-05 10:18:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:18:51,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:51,610 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2019-08-05 10:18:51,610 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1230944765, now seen corresponding path program 68 times [2019-08-05 10:18:51,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:18:51,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:52,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:18:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:52,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:52,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:18:52,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:18:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:18:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:52,780 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 50 states. [2019-08-05 10:18:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,214 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2019-08-05 10:18:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:18:54,215 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2019-08-05 10:18:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,216 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:18:54,216 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:18:54,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:18:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:18:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-08-05 10:18:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:18:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-08-05 10:18:54,220 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2019-08-05 10:18:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,220 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-08-05 10:18:54,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:18:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-08-05 10:18:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 10:18:54,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,221 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2019-08-05 10:18:54,221 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1538846455, now seen corresponding path program 69 times [2019-08-05 10:18:54,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2254 proven. 2162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:18:57,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:18:57,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:18:57,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:18:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:18:57,414 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 95 states. [2019-08-05 10:18:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:59,491 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2019-08-05 10:18:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:18:59,491 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 192 [2019-08-05 10:18:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:59,492 INFO L225 Difference]: With dead ends: 287 [2019-08-05 10:18:59,492 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:18:59,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3106 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5592, Invalid=14148, Unknown=0, NotChecked=0, Total=19740 [2019-08-05 10:18:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:18:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-05 10:18:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-05 10:18:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-08-05 10:18:59,495 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-08-05 10:18:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:59,496 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-08-05 10:18:59,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:18:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-08-05 10:18:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:18:59,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:59,497 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2019-08-05 10:18:59,497 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1328268813, now seen corresponding path program 70 times [2019-08-05 10:18:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:59,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:18:59,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:19:02,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:19:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:19:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:19:02,579 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2019-08-05 10:19:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:04,661 INFO L93 Difference]: Finished difference Result 291 states and 292 transitions. [2019-08-05 10:19:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:19:04,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2019-08-05 10:19:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:04,663 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:19:04,663 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:19:04,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5831, Invalid=14761, Unknown=0, NotChecked=0, Total=20592 [2019-08-05 10:19:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:19:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-05 10:19:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:19:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-08-05 10:19:04,666 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-08-05 10:19:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:04,666 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-08-05 10:19:04,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:19:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-08-05 10:19:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:19:04,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:04,667 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2019-08-05 10:19:04,667 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 742962671, now seen corresponding path program 71 times [2019-08-05 10:19:04,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:04,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:19:04,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:05,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:05,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:05,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:05,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:05,819 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 52 states. [2019-08-05 10:19:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:07,118 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2019-08-05 10:19:07,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:19:07,119 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2019-08-05 10:19:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:07,120 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:19:07,120 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:19:07,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:19:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:19:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-08-05 10:19:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:19:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-08-05 10:19:07,125 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2019-08-05 10:19:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:07,125 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-08-05 10:19:07,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-08-05 10:19:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:19:07,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:07,126 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2019-08-05 10:19:07,127 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:07,127 INFO L82 PathProgramCache]: Analyzing trace with hash -821131037, now seen corresponding path program 72 times [2019-08-05 10:19:07,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:07,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:19:07,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2448 proven. 2352 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:19:10,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:19:10,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:19:10,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:19:10,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:19:10,675 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 99 states. [2019-08-05 10:19:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,714 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2019-08-05 10:19:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:19:12,715 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 200 [2019-08-05 10:19:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,716 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:19:12,716 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:19:12,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3385 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6075, Invalid=15387, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:19:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:19:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-05 10:19:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:19:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-08-05 10:19:12,719 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-08-05 10:19:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,720 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-08-05 10:19:12,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:19:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-08-05 10:19:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 10:19:12,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,721 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2019-08-05 10:19:12,721 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1801644065, now seen corresponding path program 73 times [2019-08-05 10:19:12,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:19:16,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:19:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:19:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:19:16,394 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2019-08-05 10:19:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:18,522 INFO L93 Difference]: Finished difference Result 303 states and 304 transitions. [2019-08-05 10:19:18,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:19:18,522 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2019-08-05 10:19:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:18,523 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:19:18,523 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 10:19:18,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3529 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6324, Invalid=16026, Unknown=0, NotChecked=0, Total=22350 [2019-08-05 10:19:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 10:19:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-05 10:19:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:19:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-08-05 10:19:18,526 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-08-05 10:19:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:18,526 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-08-05 10:19:18,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:19:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-08-05 10:19:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:19:18,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:18,527 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2019-08-05 10:19:18,527 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 818141147, now seen corresponding path program 74 times [2019-08-05 10:19:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:18,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:19:18,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:20,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:20,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:19:20,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:19:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:19:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:20,105 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 54 states. [2019-08-05 10:19:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,442 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-08-05 10:19:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:19:21,443 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 204 [2019-08-05 10:19:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,444 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:19:21,444 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:19:21,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:19:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:19:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-08-05 10:19:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:19:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-08-05 10:19:21,448 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2019-08-05 10:19:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,449 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-08-05 10:19:21,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:19:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-08-05 10:19:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:19:21,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,450 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2019-08-05 10:19:21,450 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash -66136881, now seen corresponding path program 75 times [2019-08-05 10:19:21,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:21,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:19:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2650 proven. 2550 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:19:24,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:24,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:19:24,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:19:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:19:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:19:25,000 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 103 states. [2019-08-05 10:19:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:27,172 INFO L93 Difference]: Finished difference Result 311 states and 312 transitions. [2019-08-05 10:19:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:19:27,172 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 208 [2019-08-05 10:19:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:27,173 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:19:27,173 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 10:19:27,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3676 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6578, Invalid=16678, Unknown=0, NotChecked=0, Total=23256 [2019-08-05 10:19:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 10:19:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-08-05 10:19:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-05 10:19:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-08-05 10:19:27,177 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-08-05 10:19:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:27,178 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-08-05 10:19:27,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:19:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-08-05 10:19:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-08-05 10:19:27,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:27,178 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2019-08-05 10:19:27,179 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1015850955, now seen corresponding path program 76 times [2019-08-05 10:19:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:27,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:19:27,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:19:30,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:19:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:19:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:19:30,980 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2019-08-05 10:19:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:33,271 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2019-08-05 10:19:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:19:33,272 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2019-08-05 10:19:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:33,273 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:19:33,273 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 10:19:33,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3826 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6837, Invalid=17343, Unknown=0, NotChecked=0, Total=24180 [2019-08-05 10:19:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 10:19:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-08-05 10:19:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 10:19:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-08-05 10:19:33,277 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-08-05 10:19:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:33,277 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-08-05 10:19:33,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:19:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-08-05 10:19:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-05 10:19:33,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:33,278 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2019-08-05 10:19:33,279 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1424075719, now seen corresponding path program 77 times [2019-08-05 10:19:33,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:33,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:19:33,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:34,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:19:35,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:19:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:19:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:19:35,022 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 56 states. [2019-08-05 10:19:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:36,456 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2019-08-05 10:19:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:19:36,456 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2019-08-05 10:19:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:36,458 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:19:36,458 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:19:36,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:19:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:19:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-08-05 10:19:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 10:19:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-08-05 10:19:36,462 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2019-08-05 10:19:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:36,462 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-08-05 10:19:36,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:19:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-08-05 10:19:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-05 10:19:36,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:36,463 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2019-08-05 10:19:36,464 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1946735291, now seen corresponding path program 78 times [2019-08-05 10:19:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:36,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:19:36,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2860 proven. 2756 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:19:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:19:40,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:19:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:19:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:19:40,243 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 107 states. [2019-08-05 10:19:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:42,651 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2019-08-05 10:19:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:19:42,651 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 216 [2019-08-05 10:19:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:42,652 INFO L225 Difference]: With dead ends: 323 [2019-08-05 10:19:42,652 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:19:42,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3979 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7101, Invalid=18021, Unknown=0, NotChecked=0, Total=25122 [2019-08-05 10:19:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:19:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-08-05 10:19:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-05 10:19:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2019-08-05 10:19:42,655 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2019-08-05 10:19:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:42,655 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2019-08-05 10:19:42,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:19:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2019-08-05 10:19:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-08-05 10:19:42,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:42,656 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2019-08-05 10:19:42,657 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -34477641, now seen corresponding path program 79 times [2019-08-05 10:19:42,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:42,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:19:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:46,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:19:46,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:19:46,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:19:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:19:46,694 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2019-08-05 10:19:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:49,064 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2019-08-05 10:19:49,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:19:49,064 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2019-08-05 10:19:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:49,065 INFO L225 Difference]: With dead ends: 327 [2019-08-05 10:19:49,066 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:19:49,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4135 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7370, Invalid=18712, Unknown=0, NotChecked=0, Total=26082 [2019-08-05 10:19:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:19:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-08-05 10:19:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:19:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2019-08-05 10:19:49,069 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2019-08-05 10:19:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:49,069 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2019-08-05 10:19:49,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:19:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2019-08-05 10:19:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-05 10:19:49,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:49,071 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2019-08-05 10:19:49,071 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1309593165, now seen corresponding path program 80 times [2019-08-05 10:19:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:49,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:19:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:50,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:50,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:50,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:19:50,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:19:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:19:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:50,828 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 58 states. [2019-08-05 10:19:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,334 INFO L93 Difference]: Finished difference Result 226 states and 227 transitions. [2019-08-05 10:19:52,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:19:52,335 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 220 [2019-08-05 10:19:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,336 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:19:52,337 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 10:19:52,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:19:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 10:19:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-08-05 10:19:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-05 10:19:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-08-05 10:19:52,340 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2019-08-05 10:19:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,340 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-08-05 10:19:52,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:19:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-08-05 10:19:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-05 10:19:52,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,341 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2019-08-05 10:19:52,341 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 281772711, now seen corresponding path program 81 times [2019-08-05 10:19:52,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:52,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:19:52,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3078 proven. 2970 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:19:56,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:56,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:19:56,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:19:56,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:19:56,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:19:56,528 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 111 states. [2019-08-05 10:19:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:59,049 INFO L93 Difference]: Finished difference Result 335 states and 336 transitions. [2019-08-05 10:19:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:19:59,049 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 224 [2019-08-05 10:19:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:59,050 INFO L225 Difference]: With dead ends: 335 [2019-08-05 10:19:59,050 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 10:19:59,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4294 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7644, Invalid=19416, Unknown=0, NotChecked=0, Total=27060 [2019-08-05 10:19:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 10:19:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-08-05 10:19:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:19:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2019-08-05 10:19:59,053 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2019-08-05 10:19:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:59,054 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2019-08-05 10:19:59,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:19:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2019-08-05 10:19:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 10:19:59,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:59,055 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2019-08-05 10:19:59,055 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1989926307, now seen corresponding path program 82 times [2019-08-05 10:19:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:59,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:19:59,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:03,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:03,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:20:03,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:20:03,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:20:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:20:03,454 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2019-08-05 10:20:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:06,280 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2019-08-05 10:20:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:20:06,280 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2019-08-05 10:20:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:06,281 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:20:06,281 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 10:20:06,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4456 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7923, Invalid=20133, Unknown=0, NotChecked=0, Total=28056 [2019-08-05 10:20:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 10:20:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-08-05 10:20:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:20:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2019-08-05 10:20:06,284 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2019-08-05 10:20:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:06,284 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2019-08-05 10:20:06,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:20:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2019-08-05 10:20:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-05 10:20:06,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:06,286 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2019-08-05 10:20:06,286 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1446942305, now seen corresponding path program 83 times [2019-08-05 10:20:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:06,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:20:06,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:07,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:20:07,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:20:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:20:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:07,949 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 60 states. [2019-08-05 10:20:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:09,576 INFO L93 Difference]: Finished difference Result 234 states and 235 transitions. [2019-08-05 10:20:09,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:20:09,577 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 228 [2019-08-05 10:20:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:09,578 INFO L225 Difference]: With dead ends: 234 [2019-08-05 10:20:09,578 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:20:09,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:20:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:20:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-08-05 10:20:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:20:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-08-05 10:20:09,582 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2019-08-05 10:20:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:09,582 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-08-05 10:20:09,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:20:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-08-05 10:20:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:20:09,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:09,583 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2019-08-05 10:20:09,584 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1264196461, now seen corresponding path program 84 times [2019-08-05 10:20:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:09,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:20:09,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3304 proven. 3192 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:20:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:20:13,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:20:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:20:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:20:13,979 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 115 states. [2019-08-05 10:20:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,843 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2019-08-05 10:20:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:20:16,843 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 232 [2019-08-05 10:20:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,845 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:20:16,845 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:20:16,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4621 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8207, Invalid=20863, Unknown=0, NotChecked=0, Total=29070 [2019-08-05 10:20:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:20:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-08-05 10:20:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 10:20:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-08-05 10:20:16,849 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2019-08-05 10:20:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,849 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2019-08-05 10:20:16,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:20:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2019-08-05 10:20:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 10:20:16,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,850 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2019-08-05 10:20:16,850 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1289323407, now seen corresponding path program 85 times [2019-08-05 10:20:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:17,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:20:17,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:21,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:20:21,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:20:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:20:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:20:21,340 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2019-08-05 10:20:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:24,111 INFO L93 Difference]: Finished difference Result 351 states and 352 transitions. [2019-08-05 10:20:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:20:24,112 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2019-08-05 10:20:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:24,113 INFO L225 Difference]: With dead ends: 351 [2019-08-05 10:20:24,113 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 10:20:24,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4789 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8496, Invalid=21606, Unknown=0, NotChecked=0, Total=30102 [2019-08-05 10:20:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 10:20:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-08-05 10:20:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-05 10:20:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2019-08-05 10:20:24,116 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2019-08-05 10:20:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:24,116 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2019-08-05 10:20:24,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:20:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2019-08-05 10:20:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-05 10:20:24,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:24,117 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2019-08-05 10:20:24,117 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1499376757, now seen corresponding path program 86 times [2019-08-05 10:20:24,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:24,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:20:24,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:26,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:26,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:20:26,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:20:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:20:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:26,066 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 62 states. [2019-08-05 10:20:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:27,772 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2019-08-05 10:20:27,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 10:20:27,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 236 [2019-08-05 10:20:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:27,774 INFO L225 Difference]: With dead ends: 242 [2019-08-05 10:20:27,774 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 10:20:27,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:20:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 10:20:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-08-05 10:20:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-05 10:20:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2019-08-05 10:20:27,777 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2019-08-05 10:20:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:27,778 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2019-08-05 10:20:27,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:20:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2019-08-05 10:20:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-05 10:20:27,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:27,779 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2019-08-05 10:20:27,779 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash 174520447, now seen corresponding path program 87 times [2019-08-05 10:20:27,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:28,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:20:28,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3538 proven. 3422 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:20:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:20:32,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:20:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:20:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:20:32,600 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 119 states. [2019-08-05 10:20:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:35,448 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2019-08-05 10:20:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:20:35,448 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 240 [2019-08-05 10:20:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:35,450 INFO L225 Difference]: With dead ends: 359 [2019-08-05 10:20:35,450 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:20:35,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4960 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8790, Invalid=22362, Unknown=0, NotChecked=0, Total=31152 [2019-08-05 10:20:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:20:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-08-05 10:20:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-08-05 10:20:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2019-08-05 10:20:35,454 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2019-08-05 10:20:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:35,454 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2019-08-05 10:20:35,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:20:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2019-08-05 10:20:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-08-05 10:20:35,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:35,455 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2019-08-05 10:20:35,455 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash -277226629, now seen corresponding path program 88 times [2019-08-05 10:20:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:35,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:20:35,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:40,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:40,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-08-05 10:20:40,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-08-05 10:20:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-08-05 10:20:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:20:40,229 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 121 states. [2019-08-05 10:20:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:43,385 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2019-08-05 10:20:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 10:20:43,385 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 242 [2019-08-05 10:20:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:43,387 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:20:43,387 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 10:20:43,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5134 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9089, Invalid=23131, Unknown=0, NotChecked=0, Total=32220 [2019-08-05 10:20:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 10:20:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-08-05 10:20:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:20:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2019-08-05 10:20:43,389 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2019-08-05 10:20:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:43,390 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2019-08-05 10:20:43,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-08-05 10:20:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2019-08-05 10:20:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-05 10:20:43,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:43,391 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2019-08-05 10:20:43,391 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash -614469769, now seen corresponding path program 89 times [2019-08-05 10:20:43,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:43,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:20:43,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:45,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:20:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:45,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:45,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:20:45,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:20:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:20:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:20:45,212 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 64 states. Received shutdown request... [2019-08-05 10:20:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:20:46,202 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:20:46,207 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:20:46,207 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:20:46 BoogieIcfgContainer [2019-08-05 10:20:46,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:20:46,209 INFO L168 Benchmark]: Toolchain (without parser) took 240524.08 ms. Allocated memory was 133.7 MB in the beginning and 662.2 MB in the end (delta: 528.5 MB). Free memory was 108.9 MB in the beginning and 219.1 MB in the end (delta: -110.2 MB). Peak memory consumption was 418.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:46,210 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:20:46,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 106.7 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:20:46,211 INFO L168 Benchmark]: Boogie Preprocessor took 24.85 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 105.9 MB in the end (delta: 872.6 kB). Peak memory consumption was 872.6 kB. Max. memory is 7.1 GB. [2019-08-05 10:20:46,212 INFO L168 Benchmark]: RCFGBuilder took 355.64 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 95.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:46,212 INFO L168 Benchmark]: TraceAbstraction took 240095.50 ms. Allocated memory was 133.7 MB in the beginning and 662.2 MB in the end (delta: 528.5 MB). Free memory was 95.1 MB in the beginning and 219.1 MB in the end (delta: -124.0 MB). Peak memory consumption was 404.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:46,215 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.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.85 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 105.9 MB in the end (delta: 872.6 kB). Peak memory consumption was 872.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 355.64 ms. Allocated memory is still 133.7 MB. Free memory was 105.9 MB in the beginning and 95.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240095.50 ms. Allocated memory was 133.7 MB in the beginning and 662.2 MB in the end (delta: 528.5 MB). Free memory was 95.1 MB in the beginning and 219.1 MB in the end (delta: -124.0 MB). Peak memory consumption was 404.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 75). Cancelled while BasicCegarLoop was constructing difference of abstraction (245states) and FLOYD_HOARE automaton (currently 99 states, 64 states before enhancement),while ReachableStatesComputation was computing reachable states (193 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 240.0s OverallTime, 91 OverallIterations, 61 TraceHistogramMax, 96.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3097 SDtfs, 2050 SDslu, 27479 SDs, 0 SdLazy, 30950 SolverSat, 5511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13962 GetRequests, 6662 SyntacticMatches, 0 SemanticMatches, 7300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139094 ImplicationChecksByTransitivity, 191.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=90, 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, 90 MinimizatonAttempts, 30 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 133.9s InterpolantComputationTime, 11346 NumberOfCodeBlocks, 11346 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 11255 ConstructedInterpolants, 0 QuantifiedInterpolants, 7778599 SizeOfPredicates, 273 NumberOfNonLiveVariables, 62039 ConjunctsInSsa, 5766 ConjunctsInUnsatCore, 91 InterpolantComputations, 2 PerfectInterpolantSequences, 112530/221400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown