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/loopAcceleration/loopWithAssertion.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:17:01,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:17:01,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:17:01,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:17:01,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:17:01,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:17:01,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:17:01,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:17:01,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:17:01,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:17:01,492 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:17:01,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:17:01,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:17:01,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:17:01,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:17:01,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:17:01,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:17:01,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:17:01,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:17:01,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:17:01,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:17:01,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:17:01,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:17:01,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:17:01,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:17:01,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:17:01,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:17:01,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:17:01,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:17:01,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:17:01,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:17:01,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:17:01,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:17:01,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:17:01,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:17:01,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:17:01,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:17:01,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:17:01,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:17:01,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:17:01,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:17:01,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:17:01,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:17:01,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:17:01,590 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:17:01,591 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:17:01,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithAssertion.bpl [2019-08-05 11:17:01,592 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithAssertion.bpl' [2019-08-05 11:17:01,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:17:01,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:17:01,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:17:01,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:17:01,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:17:01,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,648 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:17:01,649 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:17:01,649 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:17:01,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:17:01,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:17:01,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:17:01,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:17:01,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/1) ... [2019-08-05 11:17:01,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:17:01,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:17:01,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:17:01,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:17:01,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (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 11:17:01,745 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:17:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:17:01,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:17:01,985 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:17:01,985 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:17:01,986 INFO L202 PluginConnector]: Adding new model loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:17:01 BoogieIcfgContainer [2019-08-05 11:17:01,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:17:01,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:17:01,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:17:01,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:17:01,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:17:01" (1/2) ... [2019-08-05 11:17:01,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629efa99 and model type loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:17:01, skipping insertion in model container [2019-08-05 11:17:01,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:17:01" (2/2) ... [2019-08-05 11:17:01,994 INFO L109 eAbstractionObserver]: Analyzing ICFG loopWithAssertion.bpl [2019-08-05 11:17:02,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:17:02,009 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:17:02,022 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:17:02,045 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:17:02,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:17:02,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:17:02,046 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:17:02,046 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:17:02,046 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:17:02,046 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:17:02,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:17:02,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:17:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:17:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:17:02,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:17:02,071 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:17:02,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:02,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:17:02,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,244 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 11:17:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:17:02,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:17:02,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:17:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:17:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:02,264 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 11:17:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:02,388 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:17:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:17:02,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:17:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:02,411 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:17:02,411 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:17:02,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:17:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:17:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:17:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:17:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:17:02,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:17:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:02,455 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:17:02,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:17:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:17:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:17:02,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,456 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:17:02,457 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:17:02,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:02,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:17:02,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:02,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:02,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:17:02,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:17:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:17:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:17:02,615 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:17:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:02,679 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:17:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:17:02,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:17:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:02,680 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:17:02,681 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:17:02,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:17:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:17:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:17:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:17:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:17:02,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:17:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:02,685 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:17:02,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:17:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:17:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:17:02,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,686 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:17:02,687 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:17:02,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:02,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:17:02,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:02,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:02,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:17:02,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:17:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:17:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:17:02,801 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:17:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:02,879 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:17:02,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:17:02,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:17:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:02,881 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:17:02,881 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:17:02,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:17:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:17:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:17:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:17:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:17:02,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:17:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:02,885 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:17:02,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:17:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:17:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:17:02,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,886 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:17:02,886 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:17:02,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:02,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:17:02,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:17:03,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:17:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:17:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:17:03,199 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 11:17:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:03,283 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:17:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:17:03,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 11:17:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:03,284 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:17:03,284 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:17:03,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:17:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:17:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:17:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:17:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:17:03,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:17:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:03,288 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:17:03,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:17:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:17:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:17:03,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:03,289 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:17:03,290 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:17:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:03,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:17:03,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:03,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:17:03,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:17:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:17:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:17:03,441 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 11:17:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:03,570 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:17:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:17:03,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 11:17:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:03,571 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:17:03,571 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:17:03,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:17:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:17:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:17:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:17:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:17:03,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:17:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:03,575 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:17:03,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:17:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:17:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:17:03,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:03,576 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 11:17:03,577 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 11:17:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:03,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:17:03,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:03,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:03,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:17:03,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:17:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:17:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:17:03,836 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2019-08-05 11:17:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:03,884 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:17:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:17:03,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:17:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:03,885 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:17:03,886 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:17:03,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:17:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:17:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:17:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:17:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:17:03,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:17:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:03,890 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:17:03,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:17:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:17:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:17:03,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:03,891 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 11:17:03,891 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 11:17:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:03,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:17:03,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:04,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:17:04,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:17:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:17:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:17:04,024 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-08-05 11:17:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,245 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:17:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:17:04,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-08-05 11:17:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,247 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:17:04,247 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:17:04,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:17:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:17:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:17:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:17:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:17:04,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:17:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,252 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:17:04,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:17:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:17:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:17:04,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,253 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 11:17:04,254 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 11:17:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:04,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:17:04,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:17:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:17:04,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:17:04,509 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-08-05 11:17:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,564 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:17:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:17:04,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-08-05 11:17:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,566 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:17:04,566 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:17:04,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:17:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:17:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:17:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:17:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:17:04,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:17:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,571 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:17:04,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:17:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:17:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:17:04,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,572 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 11:17:04,572 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 11:17:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:04,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:17:04,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:17:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:17:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:17:04,763 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-08-05 11:17:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,841 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:17:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:17:04,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 11:17:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,843 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:17:04,843 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:17:04,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:17:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:17:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:17:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:17:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:17:04,848 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:17:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,848 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:17:04,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:17:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:17:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:17:04,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,850 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 11:17:04,850 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 11:17:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:05,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:17:05,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:17:05,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:17:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:17:05,082 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 13 states. [2019-08-05 11:17:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:05,166 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:17:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:17:05,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-08-05 11:17:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:05,167 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:17:05,167 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:17:05,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:17:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:17:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:17:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:17:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:17:05,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:17:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:05,172 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:17:05,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:17:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:17:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:17:05,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:05,173 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 11:17:05,174 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:05,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 11:17:05,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:05,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:17:05,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:05,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:17:05,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:17:05,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:17:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:17:05,378 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2019-08-05 11:17:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:05,481 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:17:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:17:05,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-08-05 11:17:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:05,482 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:17:05,483 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:17:05,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:17:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:17:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:17:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:17:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:17:05,487 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:17:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:05,488 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:17:05,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:17:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:17:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:17:05,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:05,489 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 11:17:05,489 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 11:17:05,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:05,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:17:05,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:05,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:17:05,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:17:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:17:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:17:05,669 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 15 states. [2019-08-05 11:17:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:05,988 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:17:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:17:05,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 11:17:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:05,989 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:17:05,989 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:17:05,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:17:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:17:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:17:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:17:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:17:05,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:17:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:05,998 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:17:05,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:17:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:17:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:17:05,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,000 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 11:17:06,000 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 11:17:06,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:06,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:17:06,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:17:06,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:17:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:17:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:17:06,556 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2019-08-05 11:17:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:06,637 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:17:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:17:06,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-08-05 11:17:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:06,638 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:17:06,638 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:17:06,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:17:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:17:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:17:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:17:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:17:06,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:17:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:06,642 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:17:06,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:17:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:17:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:17:06,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,644 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 11:17:06,644 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 11:17:06,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:06,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:17:06,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:17:06,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:17:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:17:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:17:06,862 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2019-08-05 11:17:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:06,928 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:17:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:17:06,929 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-08-05 11:17:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:06,930 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:17:06,930 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:17:06,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:17:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:17:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:17:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:17:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:17:06,935 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:17:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:06,936 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:17:06,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:17:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:17:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:17:06,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,937 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 11:17:06,937 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 11:17:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:06,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:17:06,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:07,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:07,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:17:07,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:17:07,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:17:07,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:17:07,300 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2019-08-05 11:17:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:07,368 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:17:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:17:07,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-08-05 11:17:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:07,370 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:17:07,370 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:17:07,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:17:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:17:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:17:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:17:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:17:07,374 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:17:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:07,374 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:17:07,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:17:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:17:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:17:07,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:07,375 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 11:17:07,376 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:07,376 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 11:17:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:07,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:17:07,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:07,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:07,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:17:07,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:17:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:17:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:17:07,982 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 19 states. [2019-08-05 11:17:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:08,063 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:17:08,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:17:08,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-08-05 11:17:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:08,065 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:17:08,065 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:17:08,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:17:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:17:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:17:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:17:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:17:08,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:17:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:08,071 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:17:08,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:17:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:17:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:17:08,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:08,072 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 11:17:08,073 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 11:17:08,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:08,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:17:08,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:17:08,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:17:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:17:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:08,440 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2019-08-05 11:17:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:08,506 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:17:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:17:08,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-08-05 11:17:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:08,508 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:17:08,508 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:17:08,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:17:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:17:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:17:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:17:08,513 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:17:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:08,513 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:17:08,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:17:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:17:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:17:08,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:08,515 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 11:17:08,515 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 11:17:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:08,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:17:08,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:17:08,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:17:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:17:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:08,772 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 21 states. [2019-08-05 11:17:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:08,858 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:17:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:17:08,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-08-05 11:17:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:08,859 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:17:08,859 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:17:08,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:17:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:17:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:17:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:17:08,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:17:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:08,864 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:17:08,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:17:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:17:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:17:08,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:08,865 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 11:17:08,865 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 11:17:08,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:08,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:17:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:17:09,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:17:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:17:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:09,244 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 22 states. [2019-08-05 11:17:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:09,367 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:17:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:17:09,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-08-05 11:17:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:09,368 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:17:09,368 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:17:09,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:17:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:17:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:17:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:17:09,375 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:17:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:09,376 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:17:09,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:17:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:17:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:17:09,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:09,377 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 11:17:09,377 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 11:17:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:09,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:17:09,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:09,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:17:09,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:17:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:17:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:09,755 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 23 states. [2019-08-05 11:17:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:09,849 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:17:09,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:17:09,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-08-05 11:17:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:09,850 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:17:09,851 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:17:09,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:17:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:17:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:17:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:17:09,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:17:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:09,856 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:17:09,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:17:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:17:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:17:09,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:09,857 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 11:17:09,857 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 11:17:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:09,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:17:09,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:10,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:10,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:17:10,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:17:10,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:17:10,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:10,115 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 24 states. [2019-08-05 11:17:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:10,259 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:17:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:17:10,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-08-05 11:17:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:10,260 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:17:10,260 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:17:10,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:17:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:17:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:17:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:17:10,264 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:17:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:10,264 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:17:10,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:17:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:17:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:17:10,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:10,266 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 11:17:10,266 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 11:17:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:10,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:17:10,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:10,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:10,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:17:10,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:10,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:10,766 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 25 states. [2019-08-05 11:17:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:10,849 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:17:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:10,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2019-08-05 11:17:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:10,852 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:17:10,853 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:17:10,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:17:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:17:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:17:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:17:10,856 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:17:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:10,856 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:17:10,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:17:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:17:10,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:10,857 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 11:17:10,858 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 11:17:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:17:10,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:11,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:11,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:11,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:17:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:17:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:11,251 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 26 states. [2019-08-05 11:17:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:11,330 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:17:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:11,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-08-05 11:17:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:11,332 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:17:11,332 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:17:11,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:17:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:17:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:17:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:17:11,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:17:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:11,337 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:17:11,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:17:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:17:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:17:11,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:11,338 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 11:17:11,338 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 11:17:11,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:11,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:17:11,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:12,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:12,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:12,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:17:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:17:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:12,160 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 27 states. [2019-08-05 11:17:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:12,235 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:17:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:17:12,235 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-08-05 11:17:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:12,236 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:17:12,236 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:17:12,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:17:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:17:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:17:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:17:12,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:17:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:12,241 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:17:12,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:17:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:17:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:17:12,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:12,242 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 11:17:12,242 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 11:17:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:12,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:17:12,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:12,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:12,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:17:12,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:17:12,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:17:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:12,782 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 28 states. [2019-08-05 11:17:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:12,854 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:17:12,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:17:12,855 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-08-05 11:17:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:12,856 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:17:12,856 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:17:12,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:17:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:17:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:17:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:17:12,860 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:17:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:12,860 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:17:12,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:17:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:17:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:17:12,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:12,861 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 11:17:12,861 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 11:17:12,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:12,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:17:12,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:13,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:13,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:17:13,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:17:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:17:13,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:13,478 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 29 states. [2019-08-05 11:17:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:13,557 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:17:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:17:13,557 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-08-05 11:17:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:13,558 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:17:13,558 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:17:13,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:17:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:17:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:17:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:17:13,563 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:17:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:13,563 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:17:13,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:17:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:17:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:17:13,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:13,564 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 11:17:13,564 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 11:17:13,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:13,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:17:13,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:14,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:14,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:17:14,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:17:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:17:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:14,282 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 30 states. [2019-08-05 11:17:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:14,468 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:17:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:17:14,468 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-08-05 11:17:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:14,469 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:17:14,469 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:17:14,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:17:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:17:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:17:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:17:14,472 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:17:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:14,473 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:17:14,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:17:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:17:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:17:14,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:14,473 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 11:17:14,474 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 11:17:14,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:14,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:17:14,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:14,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:14,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:17:14,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:17:14,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:17:14,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:14,916 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 31 states. [2019-08-05 11:17:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:15,043 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:17:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:17:15,044 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-08-05 11:17:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:15,044 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:17:15,045 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:17:15,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:17:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:17:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:17:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:17:15,048 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:17:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:15,049 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:17:15,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:17:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:17:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:17:15,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:15,050 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 11:17:15,050 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:15,050 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 11:17:15,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:15,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:17:15,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:15,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:15,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:17:15,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:17:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:17:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:15,446 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 32 states. [2019-08-05 11:17:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:15,622 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:17:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:17:15,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-08-05 11:17:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:15,623 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:17:15,623 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:17:15,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:17:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:17:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:17:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:17:15,627 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:17:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:15,627 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:17:15,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:17:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:17:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:17:15,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:15,628 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 11:17:15,629 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 11:17:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:15,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:17:15,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:16,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:16,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:17:16,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:17:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:17:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:16,143 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2019-08-05 11:17:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:16,242 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:17:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:17:16,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2019-08-05 11:17:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:16,243 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:17:16,243 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:17:16,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:17:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:17:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:17:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:17:16,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:17:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:16,246 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:17:16,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:17:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:17:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:17:16,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:16,247 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 11:17:16,247 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 11:17:16,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:16,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:17:16,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:17,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:17,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:17:17,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:17:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:17:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:17,040 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 34 states. [2019-08-05 11:17:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:17,133 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:17:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:17:17,134 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2019-08-05 11:17:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:17,135 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:17:17,135 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:17:17,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:17:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:17:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:17:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:17:17,138 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:17:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:17,139 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:17:17,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:17:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:17:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:17:17,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:17,139 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 11:17:17,140 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 11:17:17,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:17,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:17:17,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:17,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:17,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:17:17,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:17:17,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:17:17,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:17,635 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 35 states. [2019-08-05 11:17:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:17,775 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:17:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:17:17,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2019-08-05 11:17:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:17,776 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:17:17,777 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:17:17,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:17:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:17:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:17:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:17:17,781 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:17:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:17,781 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:17:17,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:17:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:17:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:17:17,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:17,782 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 11:17:17,782 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:17,782 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 11:17:17,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:17,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:17:17,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:18,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:18,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:17:18,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:17:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:17:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:18,407 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 36 states. [2019-08-05 11:17:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:18,505 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:17:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:17:18,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-08-05 11:17:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:18,507 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:17:18,507 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:17:18,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:17:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:17:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:17:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:17:18,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:17:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:18,511 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:17:18,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:17:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:17:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:17:18,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:18,512 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 11:17:18,512 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 11:17:18,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:18,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:17:18,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:19,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:19,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:17:19,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:17:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:17:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:19,099 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 37 states. [2019-08-05 11:17:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:19,246 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:17:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:17:19,247 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2019-08-05 11:17:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:19,248 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:17:19,248 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:17:19,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:17:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:17:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:17:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:17:19,251 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:17:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:19,252 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:17:19,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:17:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:17:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:17:19,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:19,252 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 11:17:19,253 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 11:17:19,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:19,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:17:19,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:20,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:20,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:17:20,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:17:20,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:17:20,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:20,619 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 38 states. [2019-08-05 11:17:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:20,737 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:17:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:17:20,738 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 71 [2019-08-05 11:17:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:20,739 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:17:20,739 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:17:20,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:17:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 11:17:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:17:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:17:20,742 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:17:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:20,743 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:17:20,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:17:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:17:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:17:20,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:20,743 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 11:17:20,744 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 11:17:20,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:20,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:17:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:22,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:22,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:17:22,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:17:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:17:22,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:22,585 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 39 states. [2019-08-05 11:17:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:22,695 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:17:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:17:22,696 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-08-05 11:17:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:22,697 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:17:22,697 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:17:22,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:17:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:17:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:17:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:17:22,701 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:17:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:22,702 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:17:22,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:17:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:17:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:17:22,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:22,703 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 11:17:22,703 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 11:17:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:22,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:17:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:23,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:23,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:17:23,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:17:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:17:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:17:23,319 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 40 states. [2019-08-05 11:17:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:23,420 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:17:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:17:23,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2019-08-05 11:17:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:23,422 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:17:23,422 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:17:23,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:17:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:17:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:17:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:17:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:17:23,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:17:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:23,427 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:17:23,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:17:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:17:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:17:23,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:23,428 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 11:17:23,430 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 11:17:23,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:23,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:17:23,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:24,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:24,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:17:24,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:17:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:17:24,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:24,156 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 41 states. [2019-08-05 11:17:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:24,260 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:17:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:17:24,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-08-05 11:17:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:24,261 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:17:24,261 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:17:24,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:17:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:17:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 11:17:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:17:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:17:24,265 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:17:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:24,265 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:17:24,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:17:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:17:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:17:24,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:24,266 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 11:17:24,266 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 11:17:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:24,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:17:24,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:24,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:17:24,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:17:24,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:17:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:17:24,867 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 42 states. [2019-08-05 11:17:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:24,996 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:17:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:17:24,997 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2019-08-05 11:17:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:24,998 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:17:24,998 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:17:24,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:17:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:17:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 11:17:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:17:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:17:25,001 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:17:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:25,002 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:17:25,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:17:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:17:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:17:25,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:25,002 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 11:17:25,002 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 11:17:25,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:25,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:17:25,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:17:25,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:17:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:17:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:17:25,797 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 43 states. [2019-08-05 11:17:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:25,910 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:17:25,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:17:25,911 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-08-05 11:17:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:25,912 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:17:25,912 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:17:25,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:17:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:17:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:17:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:17:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:17:25,915 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:17:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:25,916 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:17:25,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:17:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:17:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:17:25,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:25,916 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 11:17:25,917 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 11:17:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:25,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:17:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:26,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:26,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:17:26,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:17:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:17:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:17:26,562 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 44 states. [2019-08-05 11:17:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:26,686 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:17:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:17:26,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2019-08-05 11:17:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:26,687 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:17:26,688 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:17:26,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:17:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:17:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 11:17:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:17:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:17:26,691 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:17:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:26,691 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:17:26,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:17:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:17:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:17:26,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:26,692 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 11:17:26,693 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:26,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 11:17:26,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:26,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:17:26,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:27,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:27,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:17:27,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:17:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:17:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:17:27,691 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 45 states. [2019-08-05 11:17:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:27,804 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:17:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:17:27,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-08-05 11:17:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:27,805 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:17:27,806 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:17:27,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:17:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:17:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 11:17:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:17:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:17:27,809 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:17:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:27,809 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:17:27,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:17:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:17:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:17:27,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:27,810 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 11:17:27,810 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 11:17:27,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:27,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:17:27,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:28,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:28,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:17:28,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:17:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:17:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:17:28,573 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 46 states. [2019-08-05 11:17:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,692 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:17:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:17:28,692 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2019-08-05 11:17:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,693 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:17:28,694 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:17:28,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:17:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:17:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:17:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:17:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:17:28,697 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:17:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,697 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:17:28,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:17:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:17:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:17:28,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,698 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 11:17:28,698 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 11:17:28,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:29,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:29,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:17:29,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:17:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:17:29,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:17:29,468 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 47 states. [2019-08-05 11:17:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,901 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:17:29,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:17:29,902 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 89 [2019-08-05 11:17:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,902 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:17:29,902 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:17:29,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:17:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:17:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 11:17:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:17:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:17:29,906 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:17:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,906 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:17:29,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:17:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:17:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:17:29,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,907 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 11:17:29,907 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 11:17:29,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:30,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:17:30,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:17:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:17:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:17:30,736 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2019-08-05 11:17:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:30,860 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:17:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:17:30,860 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2019-08-05 11:17:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:30,861 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:17:30,861 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:17:30,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:17:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:17:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:17:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:17:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:17:30,865 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:17:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:30,865 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:17:30,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:17:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:17:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:17:30,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:30,866 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 11:17:30,866 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 11:17:30,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:30,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:17:30,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:32,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:17:32,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:17:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:17:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:17:32,296 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 49 states. [2019-08-05 11:17:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:32,422 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:17:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:17:32,423 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-08-05 11:17:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:32,424 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:17:32,424 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:17:32,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:17:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:17:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:17:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:17:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:17:32,428 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:17:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:32,428 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:17:32,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:17:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:17:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:17:32,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:32,429 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 11:17:32,429 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 11:17:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:32,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:17:32,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:17:33,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:17:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:17:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:17:33,572 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 50 states. [2019-08-05 11:17:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:33,726 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:17:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:17:33,727 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 95 [2019-08-05 11:17:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:33,728 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:17:33,728 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:17:33,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:17:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:17:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 11:17:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:17:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:17:33,732 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:17:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:33,732 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:17:33,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:17:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:17:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:17:33,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:33,733 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 11:17:33,733 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 11:17:33,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:33,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:17:33,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:17:34,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:17:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:17:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:17:34,804 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 51 states. [2019-08-05 11:17:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:34,935 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:17:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:17:34,936 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 97 [2019-08-05 11:17:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:34,937 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:17:34,937 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:17:34,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:17:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:17:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 11:17:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:17:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:17:34,941 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:17:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:34,941 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:17:34,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:17:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:17:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:17:34,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:34,942 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 11:17:34,942 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 11:17:34,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:34,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:17:34,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:17:36,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:17:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:17:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:17:36,101 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 52 states. [2019-08-05 11:17:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:36,237 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:17:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:17:36,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2019-08-05 11:17:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:36,239 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:17:36,239 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:17:36,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:17:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:17:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:17:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:17:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:17:36,243 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:17:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:36,243 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:17:36,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:17:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:17:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:17:36,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:36,244 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 11:17:36,245 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 11:17:36,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:36,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:36,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:37,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:37,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:17:37,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:17:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:17:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:17:37,512 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 53 states. [2019-08-05 11:17:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:37,662 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:17:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:17:37,662 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 101 [2019-08-05 11:17:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:37,664 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:17:37,664 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:17:37,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:17:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:17:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:17:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:17:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:17:37,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:17:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:37,668 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:17:37,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:17:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:17:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:17:37,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:37,669 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 11:17:37,669 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 11:17:37,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:37,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:17:37,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:39,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:39,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:17:39,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:17:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:17:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:17:39,119 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 54 states. [2019-08-05 11:17:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:39,281 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:17:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:17:39,282 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 103 [2019-08-05 11:17:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:39,283 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:17:39,283 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:17:39,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:17:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:17:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:17:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:17:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:17:39,286 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:17:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:39,287 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:17:39,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:17:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:17:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:17:39,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:39,288 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 11:17:39,288 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 11:17:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:39,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:17:39,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:40,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:17:40,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:17:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:17:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:17:40,432 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 55 states. [2019-08-05 11:17:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:40,578 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:17:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:17:40,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2019-08-05 11:17:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:40,580 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:17:40,581 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:17:40,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:17:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:17:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 11:17:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:17:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:17:40,585 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 11:17:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:40,585 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:17:40,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:17:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:17:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:17:40,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:40,586 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 11:17:40,587 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-08-05 11:17:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:40,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:17:40,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:41,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:41,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:17:41,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:17:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:17:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:17:41,948 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 56 states. [2019-08-05 11:17:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:42,093 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:17:42,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:17:42,093 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2019-08-05 11:17:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:42,094 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:17:42,095 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:17:42,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:17:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:17:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 11:17:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:17:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:17:42,099 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 11:17:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:42,099 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:17:42,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:17:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:17:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:17:42,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:42,100 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 11:17:42,100 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-08-05 11:17:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:42,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:17:42,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:43,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:43,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:17:43,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:17:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:17:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:17:43,453 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 57 states. [2019-08-05 11:17:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,649 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:17:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:17:43,649 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 109 [2019-08-05 11:17:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,650 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:17:43,651 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:17:43,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:17:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:17:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 11:17:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:17:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:17:43,654 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 11:17:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,655 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:17:43,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:17:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:17:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:17:43,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,655 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 11:17:43,656 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-08-05 11:17:43,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:17:44,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:17:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:17:44,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:17:44,769 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 58 states. [2019-08-05 11:17:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:45,114 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:17:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:17:45,114 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 111 [2019-08-05 11:17:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:45,116 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:17:45,116 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:17:45,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:17:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:17:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:17:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:17:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:17:45,119 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 11:17:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:45,119 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:17:45,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:17:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:17:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:17:45,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:45,120 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 11:17:45,120 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-08-05 11:17:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:45,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:17:45,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:17:46,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:17:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:17:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:17:46,368 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 59 states. [2019-08-05 11:17:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:46,564 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:17:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:17:46,564 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 113 [2019-08-05 11:17:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:46,565 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:17:46,566 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:17:46,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:17:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:17:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 11:17:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:17:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:17:46,569 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 11:17:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:46,570 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:17:46,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:17:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:17:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:17:46,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:46,570 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 11:17:46,571 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-08-05 11:17:46,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:46,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:17:46,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:17:48,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:17:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:17:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:17:48,109 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 60 states. [2019-08-05 11:17:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:48,326 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:17:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:17:48,326 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2019-08-05 11:17:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:48,327 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:17:48,327 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:17:48,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:17:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:17:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 11:17:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:17:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:17:48,330 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 11:17:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:48,330 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:17:48,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:17:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:17:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:17:48,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:48,331 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 11:17:48,331 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-08-05 11:17:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:48,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:17:48,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:17:49,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:17:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:17:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:17:49,627 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 61 states. [2019-08-05 11:17:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:49,787 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:17:49,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:17:49,788 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 117 [2019-08-05 11:17:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:49,789 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:17:49,789 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:17:49,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:17:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:17:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 11:17:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:17:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:17:49,792 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 11:17:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:49,792 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:17:49,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:17:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:17:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:17:49,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:49,793 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 11:17:49,793 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-08-05 11:17:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:49,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:17:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:51,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:51,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:17:51,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:17:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:17:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:17:51,104 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 62 states. [2019-08-05 11:17:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:51,266 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:17:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:17:51,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 119 [2019-08-05 11:17:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:51,267 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:17:51,267 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:17:51,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:17:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:17:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 11:17:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:17:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:17:51,270 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 11:17:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:51,271 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:17:51,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:17:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:17:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:17:51,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:51,272 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 11:17:51,272 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-08-05 11:17:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:51,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:17:51,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:52,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:52,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:17:52,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:17:52,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:17:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:17:52,939 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 63 states. [2019-08-05 11:17:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:53,107 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 11:17:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:17:53,107 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 121 [2019-08-05 11:17:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:53,108 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:17:53,109 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:17:53,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:17:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:17:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 11:17:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:17:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:17:53,111 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 11:17:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:53,112 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:17:53,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:17:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:17:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:17:53,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:53,112 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 11:17:53,112 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-08-05 11:17:53,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:53,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:17:53,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:17:54,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:17:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:17:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:17:54,598 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 64 states. [2019-08-05 11:17:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:54,767 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:17:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:17:54,767 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2019-08-05 11:17:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:54,768 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:17:54,768 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:17:54,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:17:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:17:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 11:17:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:17:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:17:54,772 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 11:17:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:54,772 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:17:54,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:17:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:17:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:17:54,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:54,774 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 11:17:54,774 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-08-05 11:17:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:54,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:17:54,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:56,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:56,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:17:56,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:17:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:17:56,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:17:56,208 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 65 states. [2019-08-05 11:17:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:56,386 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:17:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:17:56,386 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 125 [2019-08-05 11:17:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:56,387 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:17:56,387 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:17:56,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:17:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:17:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 11:17:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:17:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:17:56,390 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 11:17:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:56,391 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:17:56,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:17:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:17:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:17:56,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:56,391 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 11:17:56,391 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-08-05 11:17:56,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:56,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:17:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:58,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:58,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:17:58,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:17:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:17:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:17:58,167 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 66 states. [2019-08-05 11:17:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:58,339 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 11:17:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:17:58,340 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 127 [2019-08-05 11:17:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:58,341 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:17:58,341 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:17:58,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:17:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:17:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 11:17:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:17:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:17:58,344 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 11:17:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:58,344 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:17:58,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:17:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:17:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:17:58,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:58,345 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 11:17:58,345 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-08-05 11:17:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:58,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:17:58,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:17:59,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:17:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:17:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:17:59,862 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 67 states. [2019-08-05 11:18:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:00,042 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:18:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:18:00,043 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 129 [2019-08-05 11:18:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:00,044 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:18:00,044 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:18:00,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:18:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:18:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 11:18:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:18:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:18:00,048 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 11:18:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:00,048 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:18:00,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:18:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:18:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:18:00,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:00,049 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 11:18:00,049 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-08-05 11:18:00,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:00,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:18:00,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:01,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:01,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:18:01,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:18:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:18:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:18:01,716 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 68 states. [2019-08-05 11:18:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:01,896 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:18:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:18:01,897 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2019-08-05 11:18:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:01,898 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:18:01,898 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:18:01,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:18:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:18:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 11:18:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:18:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:18:01,901 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 11:18:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:01,902 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:18:01,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:18:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:18:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:18:01,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:01,903 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 11:18:01,903 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-08-05 11:18:01,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:18:01,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:06,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:18:06,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:18:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:18:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:18:06,120 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 69 states. [2019-08-05 11:18:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:06,299 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 11:18:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:18:06,299 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 133 [2019-08-05 11:18:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:06,300 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:18:06,300 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:18:06,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:18:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:18:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:18:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:18:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:18:06,303 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 11:18:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:06,303 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:18:06,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:18:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:18:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:18:06,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:06,305 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 11:18:06,305 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-08-05 11:18:06,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:06,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:18:06,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:09,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:09,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:18:09,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:18:09,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:18:09,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:18:09,456 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 70 states. [2019-08-05 11:18:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:10,614 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:18:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:18:10,614 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 135 [2019-08-05 11:18:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:10,615 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:18:10,616 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:18:10,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:18:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:18:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 11:18:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:18:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:18:10,619 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 11:18:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:10,619 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:18:10,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:18:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:18:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:18:10,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:10,620 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 11:18:10,620 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-08-05 11:18:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:10,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:18:10,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:12,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:12,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:18:12,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:18:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:18:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:18:12,282 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 71 states. [2019-08-05 11:18:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:12,552 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:18:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:18:12,552 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 137 [2019-08-05 11:18:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:12,553 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:18:12,554 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:18:12,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:18:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:18:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 11:18:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:18:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:18:12,556 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 11:18:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:12,557 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:18:12,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:18:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:18:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:18:12,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,557 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 11:18:12,558 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2019-08-05 11:18:12,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:18:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:18:14,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:18:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:18:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:14,494 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 72 states. [2019-08-05 11:18:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:14,725 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 11:18:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:18:14,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2019-08-05 11:18:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:14,727 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:18:14,727 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:18:14,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:18:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 11:18:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:18:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:18:14,732 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 11:18:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:14,732 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:18:14,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:18:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:18:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:18:14,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:14,733 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 11:18:14,733 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2019-08-05 11:18:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:14,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:18:14,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:16,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:16,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:18:16,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:18:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:18:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:18:16,833 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 73 states. [2019-08-05 11:18:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,034 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 11:18:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:18:17,035 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 141 [2019-08-05 11:18:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,036 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:18:17,036 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:18:17,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:18:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:18:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 11:18:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:18:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 11:18:17,040 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 11:18:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,041 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 11:18:17,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:18:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 11:18:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:18:17,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,042 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 11:18:17,042 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2019-08-05 11:18:17,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:18:19,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:18:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:18:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:18:19,455 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 74 states. [2019-08-05 11:18:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:19,675 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:18:19,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:18:19,676 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 143 [2019-08-05 11:18:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:19,677 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:18:19,677 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:18:19,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:18:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:18:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 11:18:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:18:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 11:18:19,681 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 11:18:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:19,681 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 11:18:19,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:18:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 11:18:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:18:19,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:19,682 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 11:18:19,682 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2019-08-05 11:18:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:19,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:18:19,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:21,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:21,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:18:21,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:18:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:18:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:18:21,803 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 75 states. [2019-08-05 11:18:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:22,003 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 11:18:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:18:22,004 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 145 [2019-08-05 11:18:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:22,005 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:18:22,005 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:18:22,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:18:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:18:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 11:18:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:18:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:18:22,009 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 11:18:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:22,009 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:18:22,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:18:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:18:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:18:22,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:22,010 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 11:18:22,010 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2019-08-05 11:18:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:18:24,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:18:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:18:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:18:24,208 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 76 states. [2019-08-05 11:18:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:24,508 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 11:18:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:18:24,509 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2019-08-05 11:18:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:24,510 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:18:24,510 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:18:24,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:18:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:18:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 11:18:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:18:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 11:18:24,514 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 11:18:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:24,514 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 11:18:24,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:18:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 11:18:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:18:24,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:24,516 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 11:18:24,516 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2019-08-05 11:18:24,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:24,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:18:24,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:18:26,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:18:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:18:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:18:26,519 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 77 states. [2019-08-05 11:18:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:26,723 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:18:26,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:18:26,723 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 149 [2019-08-05 11:18:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:26,724 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:18:26,724 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:18:26,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:18:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:18:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 11:18:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:18:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 11:18:26,728 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 11:18:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:26,728 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 11:18:26,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:18:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 11:18:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:18:26,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:26,730 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 11:18:26,730 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2019-08-05 11:18:26,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:26,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:18:26,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:29,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:18:29,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:18:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:18:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:18:29,509 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 78 states. [2019-08-05 11:18:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:29,721 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 11:18:29,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:18:29,721 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 151 [2019-08-05 11:18:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:29,722 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:18:29,722 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:18:29,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:18:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:18:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 11:18:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:18:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:18:29,725 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 11:18:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:29,725 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:18:29,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:18:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:18:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:18:29,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:29,726 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 11:18:29,726 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2019-08-05 11:18:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:31,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:18:31,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:18:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:18:31,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:18:31,841 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 79 states. [2019-08-05 11:18:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:32,054 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 11:18:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:18:32,055 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2019-08-05 11:18:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:32,056 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:18:32,056 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:18:32,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:18:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:18:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 11:18:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:18:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 11:18:32,059 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 11:18:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:32,059 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 11:18:32,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:18:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 11:18:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:18:32,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:32,060 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 11:18:32,060 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2019-08-05 11:18:32,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:32,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:18:32,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:34,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:34,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:18:34,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:18:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:18:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:18:34,750 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 80 states. [2019-08-05 11:18:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:34,974 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:18:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:18:34,974 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 155 [2019-08-05 11:18:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:34,975 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:18:34,975 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:18:34,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:18:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:18:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 11:18:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:18:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 11:18:34,979 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 11:18:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:34,979 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 11:18:34,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:18:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 11:18:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:18:34,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:34,980 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 11:18:34,980 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2019-08-05 11:18:34,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:34,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:18:34,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:37,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:37,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:18:37,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:18:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:18:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:18:37,167 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 81 states. [2019-08-05 11:18:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,399 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 11:18:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:18:37,400 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 157 [2019-08-05 11:18:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,401 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:18:37,401 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:18:37,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:18:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:18:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:18:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:18:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:18:37,404 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 11:18:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,405 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:18:37,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:18:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:18:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:18:37,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,406 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 11:18:37,406 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2019-08-05 11:18:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:40,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:40,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:18:40,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:18:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:18:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:18:40,047 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 82 states. [2019-08-05 11:18:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:40,269 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 11:18:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:18:40,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 159 [2019-08-05 11:18:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:40,270 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:18:40,270 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:18:40,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:18:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:18:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 11:18:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:18:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 11:18:40,274 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 11:18:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:40,274 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 11:18:40,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:18:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 11:18:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:18:40,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:40,275 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 11:18:40,276 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2019-08-05 11:18:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:40,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:18:40,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:42,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:42,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:18:42,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:18:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:18:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:18:42,683 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 83 states. [2019-08-05 11:18:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,907 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:18:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:18:42,907 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 161 [2019-08-05 11:18:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,909 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:18:42,909 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:18:42,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:18:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:18:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-08-05 11:18:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:18:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 11:18:42,915 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 11:18:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,915 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 11:18:42,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:18:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 11:18:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:18:42,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,916 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 11:18:42,916 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2019-08-05 11:18:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:45,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:18:45,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:18:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:18:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:18:45,673 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 84 states. [2019-08-05 11:18:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,921 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 11:18:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:18:45,922 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 163 [2019-08-05 11:18:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,923 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:18:45,923 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:18:45,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:18:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:18:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 11:18:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:18:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:18:45,926 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 11:18:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,926 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:18:45,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:18:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:18:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:18:45,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,927 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 11:18:45,927 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2019-08-05 11:18:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:48,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:18:48,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:18:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:18:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:18:48,308 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 85 states. [2019-08-05 11:18:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:48,544 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 11:18:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:18:48,545 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 165 [2019-08-05 11:18:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:48,546 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:18:48,546 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:18:48,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:18:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:18:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-08-05 11:18:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:18:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 11:18:48,549 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 11:18:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:48,549 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 11:18:48,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:18:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 11:18:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:18:48,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:48,550 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 11:18:48,550 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2019-08-05 11:18:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:48,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:18:48,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:51,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:51,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:18:51,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:18:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:18:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:18:51,342 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 86 states. [2019-08-05 11:18:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,583 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:18:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:18:51,583 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 167 [2019-08-05 11:18:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,584 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:18:51,585 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:18:51,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:18:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:18:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 11:18:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:18:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 11:18:51,588 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 11:18:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:51,588 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 11:18:51,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:18:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 11:18:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:18:51,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:51,589 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 11:18:51,589 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2019-08-05 11:18:51,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:51,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:18:51,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:54,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:54,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:18:54,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:18:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:18:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:18:54,491 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 87 states. [2019-08-05 11:18:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:54,730 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 11:18:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:18:54,730 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 169 [2019-08-05 11:18:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:54,731 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:18:54,732 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:18:54,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:18:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:18:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-08-05 11:18:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:18:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:18:54,734 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 11:18:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:54,735 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:18:54,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:18:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:18:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:18:54,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:54,736 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 11:18:54,736 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2019-08-05 11:18:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:18:54,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:18:57,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:18:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:18:57,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:18:57,329 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 88 states. [2019-08-05 11:18:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:57,576 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 11:18:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:18:57,577 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 171 [2019-08-05 11:18:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:57,578 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:18:57,578 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:18:57,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:18:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:18:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-08-05 11:18:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:18:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 11:18:57,581 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 11:18:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:57,581 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 11:18:57,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:18:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 11:18:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:18:57,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:57,583 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 11:18:57,583 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2019-08-05 11:18:57,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:57,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:18:57,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:00,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:00,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:19:00,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:19:00,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:19:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:19:00,526 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 89 states. [2019-08-05 11:19:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:00,786 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:19:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:19:00,786 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 173 [2019-08-05 11:19:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:00,788 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:19:00,788 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:19:00,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:19:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:19:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-08-05 11:19:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:19:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 11:19:00,791 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 11:19:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:00,792 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 11:19:00,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:19:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 11:19:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:19:00,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:00,793 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 11:19:00,793 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2019-08-05 11:19:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:00,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:19:00,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:03,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:19:03,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:19:03,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:19:03,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:19:03,486 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 90 states. [2019-08-05 11:19:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:03,740 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 11:19:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:19:03,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 175 [2019-08-05 11:19:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:03,742 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:19:03,742 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:19:03,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:19:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:19:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-08-05 11:19:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:19:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:19:03,745 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 11:19:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:03,745 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:19:03,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:19:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:19:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:19:03,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:03,746 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 11:19:03,746 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2019-08-05 11:19:03,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:19:03,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:06,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:19:06,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:19:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:19:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:19:06,664 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 91 states. [2019-08-05 11:19:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:06,918 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 11:19:06,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:19:06,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 177 [2019-08-05 11:19:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:06,920 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:19:06,920 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:19:06,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:19:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:19:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 11:19:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:19:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 11:19:06,923 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 11:19:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:06,923 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 11:19:06,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:19:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 11:19:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:19:06,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:06,924 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 11:19:06,924 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2019-08-05 11:19:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:19:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:09,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:19:09,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:19:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:19:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:19:09,901 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 92 states. [2019-08-05 11:19:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:10,167 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:19:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:19:10,168 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 179 [2019-08-05 11:19:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:10,169 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:19:10,169 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:19:10,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:19:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:19:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-08-05 11:19:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:19:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 11:19:10,172 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 11:19:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:10,172 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 11:19:10,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:19:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 11:19:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:19:10,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:10,173 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2019-08-05 11:19:10,173 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2019-08-05 11:19:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:10,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:19:10,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:13,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:13,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:19:13,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:19:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:19:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:19:13,242 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 93 states. [2019-08-05 11:19:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:13,503 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 11:19:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:19:13,504 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 181 [2019-08-05 11:19:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:13,505 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:19:13,505 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:19:13,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:19:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:19:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-08-05 11:19:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:19:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:19:13,509 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 11:19:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:13,509 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:19:13,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:19:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:19:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:19:13,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:13,510 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2019-08-05 11:19:13,510 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2019-08-05 11:19:13,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:13,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:19:13,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:19:16,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:19:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:19:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:19:16,814 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 94 states. [2019-08-05 11:19:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:17,088 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-05 11:19:17,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:19:17,089 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 183 [2019-08-05 11:19:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:17,090 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:19:17,090 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:19:17,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:19:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:19:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:19:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:19:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 11:19:17,093 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 11:19:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:17,093 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 11:19:17,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:19:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 11:19:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:19:17,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:17,095 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2019-08-05 11:19:17,095 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2019-08-05 11:19:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:17,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:19:17,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:20,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:19:20,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:19:20,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:19:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:19:20,391 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 95 states. [2019-08-05 11:19:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:20,659 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:19:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:19:20,660 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 185 [2019-08-05 11:19:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:20,661 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:19:20,661 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:19:20,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:19:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:19:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-08-05 11:19:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:19:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 11:19:20,665 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 11:19:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:20,665 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 11:19:20,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:19:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 11:19:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:19:20,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:20,666 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2019-08-05 11:19:20,667 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2019-08-05 11:19:20,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:20,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:19:20,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:19:23,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:19:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:19:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:19:23,774 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 96 states. [2019-08-05 11:19:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:24,045 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 11:19:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:19:24,045 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 187 [2019-08-05 11:19:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:24,047 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:19:24,047 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:19:24,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:19:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:19:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-08-05 11:19:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:19:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:19:24,051 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 11:19:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:24,051 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:19:24,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:19:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:19:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:19:24,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:24,052 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2019-08-05 11:19:24,052 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2019-08-05 11:19:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:24,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:19:24,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:19:27,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:19:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:19:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:19:27,758 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 97 states. [2019-08-05 11:19:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:28,048 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-05 11:19:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:19:28,048 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 189 [2019-08-05 11:19:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:28,049 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:19:28,049 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:19:28,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:19:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:19:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-08-05 11:19:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:19:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 11:19:28,053 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 11:19:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:28,053 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 11:19:28,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:19:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 11:19:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:19:28,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:28,054 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2019-08-05 11:19:28,054 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2019-08-05 11:19:28,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:28,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:19:28,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:31,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:31,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:19:31,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:19:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:19:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:19:31,569 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 98 states. [2019-08-05 11:19:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:31,870 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:19:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:19:31,870 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 191 [2019-08-05 11:19:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:31,872 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:19:31,872 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:19:31,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:19:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:19:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-08-05 11:19:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:19:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 11:19:31,875 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 11:19:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:31,876 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 11:19:31,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:19:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 11:19:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:19:31,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:31,877 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2019-08-05 11:19:31,877 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2019-08-05 11:19:31,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:31,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:19:31,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:35,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:19:35,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:19:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:19:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:19:35,340 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 99 states. [2019-08-05 11:19:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:35,626 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 11:19:35,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:19:35,627 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 193 [2019-08-05 11:19:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:35,628 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:19:35,628 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:19:35,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:19:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:19:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-08-05 11:19:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:19:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:19:35,632 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 11:19:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:35,632 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:19:35,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:19:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:19:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:19:35,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:35,633 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2019-08-05 11:19:35,633 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2019-08-05 11:19:35,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:35,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:19:35,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:38,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:19:38,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:19:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:19:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:19:38,944 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 100 states. [2019-08-05 11:19:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:39,236 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-05 11:19:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:19:39,236 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 195 [2019-08-05 11:19:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:39,237 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:19:39,238 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:19:39,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:19:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:19:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-08-05 11:19:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:19:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 11:19:39,242 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 11:19:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:39,242 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 11:19:39,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:19:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 11:19:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:19:39,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:39,243 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2019-08-05 11:19:39,243 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2019-08-05 11:19:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:39,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:19:39,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:42,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:42,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:19:42,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:19:42,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:19:42,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:19:42,913 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 101 states. [2019-08-05 11:19:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:43,213 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:19:43,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:19:43,213 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 197 [2019-08-05 11:19:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:43,215 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:19:43,215 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:19:43,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:19:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:19:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-08-05 11:19:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:19:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 11:19:43,218 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 11:19:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:43,218 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 11:19:43,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:19:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 11:19:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:19:43,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:43,219 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2019-08-05 11:19:43,219 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2019-08-05 11:19:43,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:43,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:19:43,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:46,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:19:46,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:19:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:19:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:19:46,953 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 102 states. [2019-08-05 11:19:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:47,276 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:19:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:19:47,276 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 199 [2019-08-05 11:19:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:47,277 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:19:47,277 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:19:47,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:19:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:19:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-08-05 11:19:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:19:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:19:47,280 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 11:19:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:47,281 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:19:47,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:19:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:19:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:19:47,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:47,281 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2019-08-05 11:19:47,282 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2019-08-05 11:19:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:47,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:19:47,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:51,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:51,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:19:51,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:19:51,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:19:51,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:19:51,135 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 103 states. [2019-08-05 11:19:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:51,436 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-05 11:19:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:19:51,436 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 201 [2019-08-05 11:19:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:51,437 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:19:51,438 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:19:51,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:19:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:19:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-08-05 11:19:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:19:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 11:19:51,441 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 11:19:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:51,441 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 11:19:51,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:19:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 11:19:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:19:51,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:51,442 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2019-08-05 11:19:51,442 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2019-08-05 11:19:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:51,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:19:51,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:55,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:19:55,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:19:55,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:19:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:19:55,018 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 104 states. [2019-08-05 11:19:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:55,387 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:19:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:19:55,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 203 [2019-08-05 11:19:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:55,388 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:19:55,388 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:19:55,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:19:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:19:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-08-05 11:19:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:19:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 11:19:55,392 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 11:19:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:55,393 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 11:19:55,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:19:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 11:19:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:19:55,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:55,394 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2019-08-05 11:19:55,394 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2019-08-05 11:19:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:55,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:19:55,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:59,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:59,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:19:59,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:19:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:19:59,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:19:59,143 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 105 states. [2019-08-05 11:19:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:59,486 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 11:19:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:19:59,486 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 205 [2019-08-05 11:19:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:59,488 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:19:59,488 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:19:59,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:19:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:19:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-08-05 11:19:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:19:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:19:59,492 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 11:19:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:59,492 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:19:59,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:19:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:19:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:19:59,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:59,493 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2019-08-05 11:19:59,493 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2019-08-05 11:19:59,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:59,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:19:59,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:20:03,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:20:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:20:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:03,768 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 106 states. [2019-08-05 11:20:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:04,100 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-08-05 11:20:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:20:04,100 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 207 [2019-08-05 11:20:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:04,101 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:20:04,101 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:20:04,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:20:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:20:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-08-05 11:20:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 11:20:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 11:20:04,105 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 11:20:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:04,105 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 11:20:04,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:20:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 11:20:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:20:04,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:04,106 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2019-08-05 11:20:04,107 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2019-08-05 11:20:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:20:04,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:08,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:08,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:20:08,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:20:08,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:20:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:20:08,190 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 107 states. [2019-08-05 11:20:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:08,534 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:20:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:20:08,534 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 209 [2019-08-05 11:20:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:08,535 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:20:08,535 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:20:08,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:20:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:20:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-08-05 11:20:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:20:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 11:20:08,538 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 11:20:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:08,539 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 11:20:08,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:20:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 11:20:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:20:08,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:08,540 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2019-08-05 11:20:08,540 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2019-08-05 11:20:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:08,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:20:08,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:20:12,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:20:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:20:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:20:12,729 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 108 states. [2019-08-05 11:20:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:13,059 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 11:20:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:20:13,060 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 211 [2019-08-05 11:20:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:13,061 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:20:13,061 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:20:13,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:20:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:20:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:20:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:20:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:20:13,065 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 11:20:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:13,065 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:20:13,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:20:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:20:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:20:13,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:13,066 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2019-08-05 11:20:13,066 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2019-08-05 11:20:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:13,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:20:13,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:20:17,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:20:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:20:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:20:17,076 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 109 states. [2019-08-05 11:20:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:17,439 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-08-05 11:20:17,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:20:17,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 213 [2019-08-05 11:20:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:17,440 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:20:17,440 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:20:17,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:20:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:20:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-08-05 11:20:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:20:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 11:20:17,444 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 11:20:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:17,444 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 11:20:17,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:20:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 11:20:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:20:17,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:17,445 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2019-08-05 11:20:17,445 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2019-08-05 11:20:17,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:17,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:20:17,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:21,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:21,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:20:21,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:20:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:20:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:20:21,682 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 110 states. [2019-08-05 11:20:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:22,036 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:20:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:20:22,036 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 215 [2019-08-05 11:20:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:22,037 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:20:22,037 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:20:22,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:20:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:20:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-08-05 11:20:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 11:20:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 11:20:22,040 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 11:20:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:22,040 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 11:20:22,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:20:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 11:20:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:20:22,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:22,041 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2019-08-05 11:20:22,041 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2019-08-05 11:20:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:22,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:20:22,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:20:26,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:20:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:20:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:20:26,307 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 111 states. [2019-08-05 11:20:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:26,671 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-05 11:20:26,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:20:26,671 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 217 [2019-08-05 11:20:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:26,672 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:20:26,672 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:20:26,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:20:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:20:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-08-05 11:20:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:20:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 11:20:26,676 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2019-08-05 11:20:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:26,676 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 11:20:26,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:20:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 11:20:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:20:26,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:26,677 INFO L399 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2019-08-05 11:20:26,678 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2019-08-05 11:20:26,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:20:26,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:20:30,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:20:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:20:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:20:30,871 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 112 states. [2019-08-05 11:20:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:31,322 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-08-05 11:20:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:20:31,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 219 [2019-08-05 11:20:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:31,322 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:20:31,322 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:20:31,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:20:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:20:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-08-05 11:20:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-08-05 11:20:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-08-05 11:20:31,325 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2019-08-05 11:20:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:31,325 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-08-05 11:20:31,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:20:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-08-05 11:20:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:20:31,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:31,327 INFO L399 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2019-08-05 11:20:31,327 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2019-08-05 11:20:31,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:31,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:20:31,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:20:35,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:20:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:20:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:20:35,636 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 113 states. [2019-08-05 11:20:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:35,995 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-08-05 11:20:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:20:35,995 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 221 [2019-08-05 11:20:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:35,996 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:20:35,996 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:20:35,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:20:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:20:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-08-05 11:20:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:20:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-05 11:20:35,998 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2019-08-05 11:20:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:35,999 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-05 11:20:35,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:20:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-05 11:20:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:20:36,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:36,000 INFO L399 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2019-08-05 11:20:36,000 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:36,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2019-08-05 11:20:36,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:36,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:20:36,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:40,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:40,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:20:40,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:20:40,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:20:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:20:40,608 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 114 states. [2019-08-05 11:20:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:40,962 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-05 11:20:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:20:40,963 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 223 [2019-08-05 11:20:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:40,964 INFO L225 Difference]: With dead ends: 227 [2019-08-05 11:20:40,964 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 11:20:40,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:20:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 11:20:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-08-05 11:20:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 11:20:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-08-05 11:20:40,967 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2019-08-05 11:20:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:40,967 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-08-05 11:20:40,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:20:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-08-05 11:20:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:20:40,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:40,968 INFO L399 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2019-08-05 11:20:40,968 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2019-08-05 11:20:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:40,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:20:40,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:20:45,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:20:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:20:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:20:45,537 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 115 states. [2019-08-05 11:20:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:45,895 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-08-05 11:20:45,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:20:45,896 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 225 [2019-08-05 11:20:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:45,897 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:20:45,897 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:20:45,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:20:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:20:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2019-08-05 11:20:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 11:20:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2019-08-05 11:20:45,900 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2019-08-05 11:20:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:45,901 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2019-08-05 11:20:45,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:20:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2019-08-05 11:20:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:20:45,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:45,902 INFO L399 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2019-08-05 11:20:45,902 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2019-08-05 11:20:45,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:45,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:20:45,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:50,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:50,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:20:50,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:20:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:20:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:20:50,464 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 116 states. [2019-08-05 11:20:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:50,852 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-08-05 11:20:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:20:50,853 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 227 [2019-08-05 11:20:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:50,854 INFO L225 Difference]: With dead ends: 231 [2019-08-05 11:20:50,854 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 11:20:50,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:20:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 11:20:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-08-05 11:20:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 11:20:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-08-05 11:20:50,857 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2019-08-05 11:20:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:50,857 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-08-05 11:20:50,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:20:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-08-05 11:20:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-05 11:20:50,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:50,859 INFO L399 BasicCegarLoop]: trace histogram [114, 113, 1, 1] [2019-08-05 11:20:50,859 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:50,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886654, now seen corresponding path program 113 times [2019-08-05 11:20:50,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:50,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:20:50,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:55,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:20:55,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:20:55,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:20:55,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:20:55,649 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 117 states. [2019-08-05 11:20:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:56,051 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-08-05 11:20:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:20:56,051 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 229 [2019-08-05 11:20:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:56,052 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:20:56,052 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:20:56,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:20:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:20:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-08-05 11:20:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 11:20:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-08-05 11:20:56,056 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2019-08-05 11:20:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:56,056 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-08-05 11:20:56,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:20:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-08-05 11:20:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 11:20:56,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:56,057 INFO L399 BasicCegarLoop]: trace histogram [115, 114, 1, 1] [2019-08-05 11:20:56,057 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash -156201532, now seen corresponding path program 114 times [2019-08-05 11:20:56,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:00,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:00,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:21:00,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:21:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:21:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:00,968 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 118 states. [2019-08-05 11:21:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:01,371 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-08-05 11:21:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:21:01,372 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 231 [2019-08-05 11:21:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:01,373 INFO L225 Difference]: With dead ends: 235 [2019-08-05 11:21:01,373 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 11:21:01,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:21:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 11:21:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-08-05 11:21:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-08-05 11:21:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2019-08-05 11:21:01,376 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 231 [2019-08-05 11:21:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:01,377 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2019-08-05 11:21:01,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:21:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2019-08-05 11:21:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-08-05 11:21:01,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:01,377 INFO L399 BasicCegarLoop]: trace histogram [116, 115, 1, 1] [2019-08-05 11:21:01,378 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 214184198, now seen corresponding path program 115 times [2019-08-05 11:21:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:01,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:21:01,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:21:01,465 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:21:01,465 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:21:01,469 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:21:01,469 INFO L202 PluginConnector]: Adding new model loopWithAssertion.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:01 BoogieIcfgContainer [2019-08-05 11:21:01,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:01,472 INFO L168 Benchmark]: Toolchain (without parser) took 239853.59 ms. Allocated memory was 133.7 MB in the beginning and 878.7 MB in the end (delta: 745.0 MB). Free memory was 111.5 MB in the beginning and 279.3 MB in the end (delta: -167.8 MB). Peak memory consumption was 577.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,472 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.36 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,473 INFO L168 Benchmark]: Boogie Preprocessor took 21.28 ms. Allocated memory is still 133.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,474 INFO L168 Benchmark]: RCFGBuilder took 313.03 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 99.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,475 INFO L168 Benchmark]: TraceAbstraction took 239481.87 ms. Allocated memory was 133.7 MB in the beginning and 878.7 MB in the end (delta: 745.0 MB). Free memory was 99.1 MB in the beginning and 279.3 MB in the end (delta: -180.2 MB). Peak memory consumption was 564.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:01,477 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.16 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.36 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.28 ms. Allocated memory is still 133.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.03 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 99.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239481.87 ms. Allocated memory was 133.7 MB in the beginning and 878.7 MB in the end (delta: 745.0 MB). Free memory was 99.1 MB in the beginning and 279.3 MB in the end (delta: -180.2 MB). Peak memory consumption was 564.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 234 with TraceHistMax 116,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 239.4s OverallTime, 116 OverallIterations, 116 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 6670 SDslu, 0 SDs, 0 SdLazy, 14888 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13340 GetRequests, 6555 SyntacticMatches, 0 SemanticMatches, 6785 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 209.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=115, 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.3s AutomataMinimizationTime, 115 MinimizatonAttempts, 115 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 212.8s InterpolantComputationTime, 13455 NumberOfCodeBlocks, 13455 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 13340 ConstructedInterpolants, 0 QuantifiedInterpolants, 6163080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 27140 ConjunctsInSsa, 6900 ConjunctsInUnsatCore, 115 InterpolantComputations, 1 PerfectInterpolantSequences, 0/506920 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown