java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:38:48,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:38:48,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:38:48,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:38:48,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:38:48,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:38:48,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:38:48,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:38:48,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:38:48,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:38:48,527 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:38:48,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:38:48,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:38:48,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:38:48,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:38:48,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:38:48,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:38:48,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:38:48,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:38:48,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:38:48,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:38:48,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:38:48,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:38:48,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:38:48,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:38:48,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:38:48,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:38:48,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:38:48,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:38:48,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:38:48,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:38:48,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:38:48,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:38:48,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:38:48,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:38:48,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:38:48,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:38:48,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:38:48,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:38:48,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:38:48,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:38:48,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:38:48,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:38:48,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:38:48,625 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:38:48,626 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:38:48,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl [2019-08-05 10:38:48,627 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl' [2019-08-05 10:38:48,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:38:48,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:38:48,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:38:48,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:38:48,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:38:48,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,690 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:38:48,690 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:38:48,690 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:38:48,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:38:48,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:38:48,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:38:48,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:38:48,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... [2019-08-05 10:38:48,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:38:48,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:38:48,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:38:48,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:38:48,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:38:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:38:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:38:48,989 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:38:48,990 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:38:48,991 INFO L202 PluginConnector]: Adding new model LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:38:48 BoogieIcfgContainer [2019-08-05 10:38:48,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:38:48,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:38:48,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:38:48,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:38:48,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:38:48" (1/2) ... [2019-08-05 10:38:48,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3012a40d and model type LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:38:48, skipping insertion in model container [2019-08-05 10:38:48,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:38:48" (2/2) ... [2019-08-05 10:38:49,000 INFO L109 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-Reduced.bpl [2019-08-05 10:38:49,009 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:38:49,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:38:49,031 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:38:49,054 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:38:49,055 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:38:49,055 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:38:49,056 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:38:49,056 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:38:49,056 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:38:49,056 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:38:49,056 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:38:49,056 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:38:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:38:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:38:49,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:38:49,084 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 10:38:49,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:49,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:38:49,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:38:49,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:38:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:38:49,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:38:49,260 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:38:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,332 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:38:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:38:49,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:38:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,345 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:38:49,345 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:38:49,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:38:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:38:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:38:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:38:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:38:49,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:38:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,377 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:38:49,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:38:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:38:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:38:49,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,378 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:38:49,378 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 10:38:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,656 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 10:38:49,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:49,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:38:49,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:38:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:38:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:38:49,660 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 10:38:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,793 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:38:49,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:38:49,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:38:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,795 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:38:49,795 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:38:49,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:38:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:38:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:38:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:38:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:38:49,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:38:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,799 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:38:49,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:38:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:38:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:38:49,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,800 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 10:38:49,801 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 10:38:49,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,964 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 10:38:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:38:49,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:38:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:38:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:38:49,966 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 10:38:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:50,034 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:38:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:38:50,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:38:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:50,035 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:38:50,036 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:38:50,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:38:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:38:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:38:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:38:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:38:50,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:38:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:50,041 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:38:50,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:38:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:38:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:38:50,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:50,042 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 10:38:50,043 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 10:38:50,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:50,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:38:50,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:50,366 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 10:38:50,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:38:50,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:38:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:38:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:38:50,368 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 10:38:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:50,451 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:38:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:38:50,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:38:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:50,453 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:38:50,453 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:38:50,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:38:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:38:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:38:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:38:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:38:50,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:38:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:50,457 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:38:50,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:38:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:38:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:38:50,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:50,458 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 10:38:50,458 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 10:38:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:50,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:38:50,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:50,620 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 10:38:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:38:50,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:38:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:38:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:38:50,622 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 10:38:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:50,682 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:38:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:38:50,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:38:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:50,683 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:38:50,683 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:38:50,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:38:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:38:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:38:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:38:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:38:50,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:38:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:50,690 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:38:50,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:38:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:38:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:38:50,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:50,691 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 10:38:50,691 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 10:38:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:50,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:38:50,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:50,942 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 10:38:50,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:38:50,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:38:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:38:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:38:50,946 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:38:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:50,997 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:38:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:38:50,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:38:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:50,999 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:38:51,000 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:38:51,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:38:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:38:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:38:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:38:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:38:51,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:38:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:51,004 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:38:51,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:38:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:38:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:38:51,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:51,005 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 10:38:51,005 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 10:38:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:51,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:38:51,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:51,170 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 10:38:51,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:51,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:38:51,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:38:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:38:51,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:38:51,172 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 10:38:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:51,289 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:38:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:38:51,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:38:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:51,292 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:38:51,293 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:38:51,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:38:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:38:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:38:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:38:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:38:51,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:38:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:51,296 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:38:51,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:38:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:38:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:38:51,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:51,297 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 10:38:51,298 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 10:38:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:51,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:38:51,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:51,806 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 10:38:51,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:51,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:38:51,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:38:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:38:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:38:51,808 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 10:38:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:51,897 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:38:51,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:38:51,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:38:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:51,898 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:38:51,898 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:38:51,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:38:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:38:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:38:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:38:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:38:51,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:38:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:51,903 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:38:51,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:38:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:38:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:38:51,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:51,904 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 10:38:51,904 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 10:38:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:51,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:38:51,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:52,112 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 10:38:52,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:38:52,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:38:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:38:52,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:38:52,115 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 10:38:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,187 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:38:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:38:52,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:38:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,189 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:38:52,190 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:38:52,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:38:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:38:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:38:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:38:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:38:52,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:38:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,194 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:38:52,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:38:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:38:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:38:52,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,202 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 10:38:52,202 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 10:38:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:52,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:38:52,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:52,498 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 10:38:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:38:52,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:38:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:38:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:38:52,500 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 10:38:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,565 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:38:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:38:52,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:38:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,567 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:38:52,567 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:38:52,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:38:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:38:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:38:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:38:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:38:52,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:38:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,572 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:38:52,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:38:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:38:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:38:52,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,573 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 10:38:52,573 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 10:38:52,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:52,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:38:52,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:52,763 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 10:38:52,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:38:52,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:38:52,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:38:52,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:38:52,765 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 10:38:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,819 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:38:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:38:52,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:38:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,821 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:38:52,822 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:38:52,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:38:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:38:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:38:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:38:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:38:52,826 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:38:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,826 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:38:52,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:38:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:38:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:38:52,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,828 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 10:38:52,828 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 10:38:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:52,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:38:52,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:53,030 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 10:38:53,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:53,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:38:53,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:38:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:38:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:38:53,032 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 10:38:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:53,080 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:38:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:38:53,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:38:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:53,082 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:38:53,082 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:38:53,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 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 10:38:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:38:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:38:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:38:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:38:53,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:38:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:53,086 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:38:53,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:38:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:38:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:38:53,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:53,088 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 10:38:53,088 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 10:38:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:53,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:38:53,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:53,483 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 10:38:53,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:53,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:38:53,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:38:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:38:53,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:38:53,485 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 10:38:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:53,692 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:38:53,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:38:53,693 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 10:38:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:53,693 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:38:53,694 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:38:53,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:38:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:38:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:38:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:38:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:38:53,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:38:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:53,704 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:38:53,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:38:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:38:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:38:53,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:53,706 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 10:38:53,706 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 10:38:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:53,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:38:53,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,190 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 10:38:54,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:54,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:38:54,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:38:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:38:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:38:54,192 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 10:38:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:54,486 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:38:54,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:38:54,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:38:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:54,487 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:38:54,488 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:38:54,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:38:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:38:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:38:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:38:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:38:54,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:38:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:54,497 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:38:54,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:38:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:38:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:38:54,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:54,501 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 10:38:54,501 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 10:38:54,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,937 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 10:38:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:38:54,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:38:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:38:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:38:54,939 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 10:38:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:55,009 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:38:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:38:55,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 10:38:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:55,010 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:38:55,010 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:38:55,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:38:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:38:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:38:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:38:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:38:55,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:38:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:55,015 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:38:55,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:38:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:38:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:38:55,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:55,016 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 10:38:55,016 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 10:38:55,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:55,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:38:55,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:55,305 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 10:38:55,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:55,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:38:55,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:38:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:38:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:38:55,307 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 10:38:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:55,490 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:38:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:38:55,491 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:38:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:55,492 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:38:55,492 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:38:55,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:38:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:38:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:38:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:38:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:38:55,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:38:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:55,497 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:38:55,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:38:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:38:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:38:55,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:55,498 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 10:38:55,498 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 10:38:55,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:55,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:38:55,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:55,926 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 10:38:55,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:55,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:38:55,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:38:55,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:38:55,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:38:55,928 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 10:38:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:55,999 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:38:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:38:56,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 10:38:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,000 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:38:56,000 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:38:56,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:38:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:38:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:38:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:38:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:38:56,005 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:38:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,006 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:38:56,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:38:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:38:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:38:56,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,007 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 10:38:56,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 10:38:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:56,284 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 10:38:56,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:56,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:38:56,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:38:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:38:56,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:38:56,287 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 10:38:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:56,391 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:38:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:38:56,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:38:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,392 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:38:56,392 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:38:56,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:38:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:38:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:38:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:38:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:38:56,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:38:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,397 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:38:56,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:38:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:38:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:38:56,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,398 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 10:38:56,398 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 10:38:56,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:56,827 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 10:38:56,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:56,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:38:56,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:38:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:38:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:38:56,829 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 10:38:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:56,905 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:38:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:38:56,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 10:38:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,906 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:38:56,906 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:38:56,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:38:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:38:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:38:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:38:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:38:56,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:38:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,911 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:38:56,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:38:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:38:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:38:56,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,912 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 10:38:56,912 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 10:38:56,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:57,325 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 10:38:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:38:57,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:38:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:38:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:38:57,327 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 10:38:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:57,402 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:38:57,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:38:57,403 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:38:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:57,404 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:38:57,404 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:38:57,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 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 10:38:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:38:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:38:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:38:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:38:57,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:38:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:57,411 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:38:57,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:38:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:38:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:38:57,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:57,411 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 10:38:57,412 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 10:38:57,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:57,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:38:57,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:57,807 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 10:38:57,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:38:57,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:38:57,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:38:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:38:57,808 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 10:38:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:57,887 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:38:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:38:57,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 10:38:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:57,889 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:38:57,889 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:38:57,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 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 10:38:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:38:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:38:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:38:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:38:57,894 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:38:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:57,894 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:38:57,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:38:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:38:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:38:57,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:57,895 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 10:38:57,896 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:57,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 10:38:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:57,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:38:57,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:58,399 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 10:38:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:38:58,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:38:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:38:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:38:58,401 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 10:38:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:58,496 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:38:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:38:58,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:38:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:58,505 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:38:58,505 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:38:58,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:38:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:38:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:38:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:38:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:38:58,508 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:38:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:58,509 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:38:58,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:38:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:38:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:38:58,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:58,510 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 10:38:58,510 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 10:38:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:58,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:38:58,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:58,957 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 10:38:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:58,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:38:58,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:38:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:38:58,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:38:58,959 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 10:38:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:59,049 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:38:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:38:59,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 10:38:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:59,050 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:38:59,050 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:38:59,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 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 10:38:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:38:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:38:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:38:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:38:59,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:38:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:59,055 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:38:59,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:38:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:38:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:38:59,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:59,058 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 10:38:59,058 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 10:38:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:59,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:38:59,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:59,595 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 10:38:59,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:59,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:38:59,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:38:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:38:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:38:59,596 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 10:38:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:59,715 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:38:59,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:38:59,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:38:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:59,716 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:38:59,717 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:38:59,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:38:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:38:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:38:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:38:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:38:59,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:38:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:59,722 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:38:59,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:38:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:38:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:38:59,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:59,723 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 10:38:59,723 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:59,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 10:38:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:59,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:38:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:00,597 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 10:39:00,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:00,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:39:00,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:39:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:39:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:00,599 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 10:39:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:00,671 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:39:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:39:00,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 10:39:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:00,673 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:39:00,673 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:39:00,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:39:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:39:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:39:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:39:00,677 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:39:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:00,678 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:39:00,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:39:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:39:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:39:00,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:00,679 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 10:39:00,679 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 10:39:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:00,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:39:00,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:01,272 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 10:39:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:39:01,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:39:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:39:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:01,273 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 10:39:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:01,386 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:39:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:39:01,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:39:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:01,388 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:39:01,388 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:39:01,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 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 10:39:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:39:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:39:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:39:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:39:01,393 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:39:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:01,393 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:39:01,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:39:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:39:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:39:01,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:01,394 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 10:39:01,394 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 10:39:01,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:01,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:39:01,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,187 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 10:39:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:39:02,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:39:02,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:39:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:02,189 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 10:39:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:02,270 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:39:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:39:02,271 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:39:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:02,271 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:39:02,272 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:39:02,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:39:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:39:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:39:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:39:02,276 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:39:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:02,276 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:39:02,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:39:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:39:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:39:02,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:02,277 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 10:39:02,277 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 10:39:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:02,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:39:02,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:02,966 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 10:39:02,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:02,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:39:02,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:39:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:39:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:02,968 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 10:39:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:03,055 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:39:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:39:03,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:39:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:03,057 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:39:03,057 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:39:03,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 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 10:39:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:39:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:39:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:39:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:39:03,060 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:39:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:03,060 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:39:03,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:39:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:39:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:39:03,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:03,061 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 10:39:03,061 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 10:39:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:03,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:39:03,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:05,031 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 10:39:05,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:05,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:39:05,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:39:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:39:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:05,033 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 10:39:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:05,188 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:39:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:39:05,189 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 10:39:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:05,190 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:39:05,190 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:39:05,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:39:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:39:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:39:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:39:05,194 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:39:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:05,194 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:39:05,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:39:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:39:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:39:05,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:05,195 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 10:39:05,195 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 10:39:05,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:05,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:39:05,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:05,802 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 10:39:05,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:05,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:39:05,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:39:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:39:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:05,803 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 10:39:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:05,949 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:39:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:39:05,950 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:39:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:05,950 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:39:05,951 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:39:05,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:39:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:39:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:39:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:39:05,954 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:39:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:05,954 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:39:05,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:39:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:39:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:39:05,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:05,954 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 10:39:05,955 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 10:39:05,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:05,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:39:05,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,590 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 10:39:06,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:39:06,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:39:06,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:39:06,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:06,592 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 10:39:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:06,734 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:39:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:39:06,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 10:39:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:06,735 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:39:06,736 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:39:06,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:39:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:39:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:39:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:39:06,739 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:39:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:06,740 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:39:06,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:39:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:39:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:39:06,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:06,741 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 10:39:06,741 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 10:39:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:06,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:39:06,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:07,374 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 10:39:07,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:07,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:39:07,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:39:07,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:39:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:07,376 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 10:39:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:07,471 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:39:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:39:07,472 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:39:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:07,473 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:39:07,473 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:39:07,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:39:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:39:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:39:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:39:07,477 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:39:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:07,477 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:39:07,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:39:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:39:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:39:07,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:07,478 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 10:39:07,479 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 10:39:07,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:07,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:39:07,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:08,124 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 10:39:08,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:08,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:39:08,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:39:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:39:08,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:08,126 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 10:39:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:08,271 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:39:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:39:08,272 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 10:39:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:08,272 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:39:08,273 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:39:08,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:39:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:39:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:39:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:39:08,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:39:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:08,277 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:39:08,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:39:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:39:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:39:08,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:08,278 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 10:39:08,278 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 10:39:08,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:08,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:39:08,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:08,952 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 10:39:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:08,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:39:08,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:39:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:39:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:39:08,954 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 10:39:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:09,063 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:39:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:39:09,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:39:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:09,064 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:39:09,064 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:39:09,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:39:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:39:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:39:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:39:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:39:09,067 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:39:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:09,067 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:39:09,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:39:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:39:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:39:09,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:09,068 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 10:39:09,068 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:09,068 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 10:39:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:09,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:39:09,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:09,880 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 10:39:09,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:09,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:39:09,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:39:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:39:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:39:09,881 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 10:39:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:10,012 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:39:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:39:10,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 10:39:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:10,014 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:39:10,014 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:39:10,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:39:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:39:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:39:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:39:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:39:10,017 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:39:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:10,018 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:39:10,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:39:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:39:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:39:10,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:10,019 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 10:39:10,019 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 10:39:10,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:10,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:39:10,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:11,589 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 10:39:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:39:11,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:39:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:39:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:39:11,591 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 10:39:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:11,715 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:39:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:39:11,716 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:39:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:11,716 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:39:11,717 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:39:11,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:39:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:39:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:39:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:39:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:39:11,720 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:39:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:11,720 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:39:11,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:39:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:39:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:39:11,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:11,721 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 10:39:11,721 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 10:39:11,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:11,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:39:11,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:12,856 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 10:39:12,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:12,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:39:12,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:39:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:39:12,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:39:12,858 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 10:39:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:12,965 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:39:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:39:12,965 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 10:39:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:12,966 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:39:12,966 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:39:12,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:39:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:39:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:39:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:39:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:39:12,970 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:39:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:12,970 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:39:12,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:39:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:39:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:39:12,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:12,971 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 10:39:12,971 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 10:39:12,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:12,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:39:12,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:13,797 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 10:39:13,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:13,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:39:13,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:39:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:39:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:39:13,799 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 10:39:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,909 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:39:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:39:13,910 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:39:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,911 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:39:13,911 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:39:13,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:39:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:39:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:39:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:39:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:39:13,915 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:39:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,915 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:39:13,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:39:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:39:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:39:13,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,916 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 10:39:13,916 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 10:39:13,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:14,862 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 10:39:14,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:14,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:39:14,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:39:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:39:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:39:14,864 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 10:39:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:15,012 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:39:15,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:39:15,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 10:39:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:15,014 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:39:15,014 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:39:15,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:39:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:39:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:39:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:39:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:39:15,019 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:39:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:15,019 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:39:15,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:39:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:39:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:39:15,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:15,020 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 10:39:15,020 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 10:39:15,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:15,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:39:15,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:15,886 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 10:39:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:15,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:39:15,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:39:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:39:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:39:15,888 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 10:39:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:16,028 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:39:16,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:39:16,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:39:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:16,029 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:39:16,030 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:39:16,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:39:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:39:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:39:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:39:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:39:16,033 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:39:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:16,034 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:39:16,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:39:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:39:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:39:16,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:16,034 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 10:39:16,035 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 10:39:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:16,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:39:16,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:16,887 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 10:39:16,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:16,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:39:16,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:39:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:39:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:39:16,889 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 10:39:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:17,019 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:39:17,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:39:17,020 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 10:39:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:17,021 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:39:17,021 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:39:17,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:39:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:39:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:39:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:39:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:39:17,025 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:39:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:17,025 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:39:17,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:39:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:39:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:39:17,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:17,026 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 10:39:17,027 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 10:39:17,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:17,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:39:17,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:18,293 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 10:39:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:39:18,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:39:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:39:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:39:18,294 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 10:39:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:18,419 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:39:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:39:18,419 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:39:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:18,421 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:39:18,421 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:39:18,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:39:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:39:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:39:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:39:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:39:18,425 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:39:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:18,425 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:39:18,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:39:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:39:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:39:18,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:18,426 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 10:39:18,426 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 10:39:18,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:18,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:39:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:19,511 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 10:39:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:39:19,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:39:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:39:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:39:19,513 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 10:39:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:19,657 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:39:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:39:19,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 10:39:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:19,659 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:39:19,659 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:39:19,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:39:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:39:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:39:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:39:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:39:19,663 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:39:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:19,663 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:39:19,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:39:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:39:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:39:19,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:19,664 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 10:39:19,664 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 10:39:19,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:19,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:39:19,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:20,670 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 10:39:20,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:20,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:39:20,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:39:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:39:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:39:20,671 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 10:39:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:20,799 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:39:20,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:39:20,800 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:39:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:20,801 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:39:20,801 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:39:20,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:39:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:39:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:39:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:39:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:39:20,804 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:39:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:20,805 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:39:20,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:39:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:39:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:39:20,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:20,805 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 10:39:20,805 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 10:39:20,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:20,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:39:20,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:21,833 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 10:39:21,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:21,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:39:21,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:39:21,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:39:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:39:21,835 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 10:39:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:22,293 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:39:22,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:39:22,294 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 10:39:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:22,294 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:39:22,294 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:39:22,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:39:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:39:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:39:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:39:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:39:22,299 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:39:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:22,299 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:39:22,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:39:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:39:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:39:22,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:22,301 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 10:39:22,301 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 10:39:22,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:22,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:39:22,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:23,628 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 10:39:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:39:23,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:39:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:39:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:39:23,630 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 10:39:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:23,761 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:39:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:39:23,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:39:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:23,763 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:39:23,763 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:39:23,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:39:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:39:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:39:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:39:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:39:23,766 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:39:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:23,766 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:39:23,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:39:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:39:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:39:23,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:23,767 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 10:39:23,767 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 10:39:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:23,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:39:23,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:24,901 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 10:39:24,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:24,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:39:24,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:39:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:39:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:39:24,903 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 10:39:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:25,039 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:39:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:39:25,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 10:39:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:25,041 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:39:25,041 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:39:25,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:39:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:39:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:39:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:39:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:39:25,045 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:39:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:25,045 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:39:25,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:39:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:39:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:39:25,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:25,046 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 10:39:25,046 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 10:39:25,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:25,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:39:25,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:26,318 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 10:39:26,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:26,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:39:26,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:39:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:39:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:39:26,319 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 10:39:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:26,460 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:39:26,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:39:26,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:39:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:26,461 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:39:26,461 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:39:26,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:39:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:39:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:39:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:39:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:39:26,465 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:39:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:26,465 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:39:26,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:39:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:39:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:39:26,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:26,466 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 10:39:26,467 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 10:39:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:26,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:39:26,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:28,007 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 10:39:28,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:28,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:39:28,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:39:28,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:39:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:39:28,009 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 10:39:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:28,178 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:39:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:39:28,178 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 10:39:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:28,179 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:39:28,180 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:39:28,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:39:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:39:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:39:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:39:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:39:28,183 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:39:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:28,183 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:39:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:39:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:39:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:39:28,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:28,184 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 10:39:28,184 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 10:39:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:30,687 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 10:39:30,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:30,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:39:30,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:39:30,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:39:30,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:39:30,688 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 10:39:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:30,862 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:39:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:39:30,863 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:39:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:30,864 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:39:30,864 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:39:30,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:39:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:39:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:39:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:39:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:39:30,868 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 10:39:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:30,868 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:39:30,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:39:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:39:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:39:30,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:30,869 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 10:39:30,869 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 10:39:30,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:30,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:39:30,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:32,169 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 10:39:32,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:32,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:39:32,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:39:32,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:39:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:39:32,170 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 10:39:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:32,329 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:39:32,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:39:32,329 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 10:39:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:32,331 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:39:32,331 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:39:32,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 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 10:39:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:39:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:39:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:39:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:39:32,334 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 10:39:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:32,335 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:39:32,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:39:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:39:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:39:32,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:32,336 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 10:39:32,336 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 10:39:32,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:32,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:39:32,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:33,998 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 10:39:33,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:33,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:39:33,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:39:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:39:34,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:39:34,000 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 10:39:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:34,187 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:39:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:39:34,188 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:39:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:34,189 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:39:34,189 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:39:34,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:39:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:39:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:39:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:39:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:39:34,193 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 10:39:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:34,193 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:39:34,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:39:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:39:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:39:34,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:34,194 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 10:39:34,194 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-08-05 10:39:34,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:34,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:39:34,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:35,874 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 10:39:35,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:35,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:39:35,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:39:35,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:39:35,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:39:35,875 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 10:39:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:36,032 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:39:36,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:39:36,032 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 10:39:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:36,034 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:39:36,034 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:39:36,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:39:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:39:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:39:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:39:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:39:36,037 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 10:39:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:36,037 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:39:36,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:39:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:39:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:39:36,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:36,038 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 10:39:36,039 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-08-05 10:39:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:36,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:39:36,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:37,459 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 10:39:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:37,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:39:37,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:39:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:39:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:39:37,461 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 10:39:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:37,648 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:39:37,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:39:37,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 10:39:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:37,650 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:39:37,650 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:39:37,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 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 10:39:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:39:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:39:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:39:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:39:37,652 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 10:39:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:37,652 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:39:37,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:39:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:39:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:39:37,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:37,653 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 10:39:37,653 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-08-05 10:39:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:37,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:39:37,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:40,039 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 10:39:40,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:40,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:39:40,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:39:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:39:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:39:40,040 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 10:39:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:40,214 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:39:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:39:40,215 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 10:39:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:40,216 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:39:40,217 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:39:40,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:39:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:39:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:39:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:39:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:39:40,220 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 10:39:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:40,220 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:39:40,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:39:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:39:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:39:40,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:40,221 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 10:39:40,222 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-08-05 10:39:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:40,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:39:40,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,705 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 10:39:41,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:39:41,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:39:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:39:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:39:41,707 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 10:39:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,226 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:39:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:39:42,227 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 10:39:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,228 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:39:42,228 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:39:42,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:39:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:39:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:39:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:39:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:39:42,231 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 10:39:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,232 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:39:42,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:39:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:39:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:39:42,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,233 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 10:39:42,233 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-08-05 10:39:42,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,070 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 10:39:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:39:44,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:39:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:39:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:39:44,072 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 10:39:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,246 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:39:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:39:44,246 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 10:39:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,248 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:39:44,248 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:39:44,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:39:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:39:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:39:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:39:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:39:44,250 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 10:39:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,251 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:39:44,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:39:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:39:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:39:44,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,251 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 10:39:44,251 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-08-05 10:39:44,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:45,813 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 10:39:45,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:39:45,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:39:45,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:39:45,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:39:45,814 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 10:39:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,995 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:39:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:39:45,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 10:39:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,997 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:39:45,997 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:39:45,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:39:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:39:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:39:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:39:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:39:46,000 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 10:39:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,001 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:39:46,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:39:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:39:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:39:46,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,001 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 10:39:46,001 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-08-05 10:39:46,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,814 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 10:39:47,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:39:47,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:39:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:39:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:39:47,815 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 10:39:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:48,068 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:39:48,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:39:48,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 10:39:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:48,068 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:39:48,069 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:39:48,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:39:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:39:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:39:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:39:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:39:48,072 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 10:39:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:48,072 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:39:48,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:39:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:39:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:39:48,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:48,073 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 10:39:48,073 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-08-05 10:39:48,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:39:48,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:49,755 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 10:39:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:39:49,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:39:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:39:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:39:49,757 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 10:39:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:49,940 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:39:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:39:49,941 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 10:39:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:49,941 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:39:49,942 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:39:49,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:39:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:39:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:39:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:39:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:39:49,945 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 10:39:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:49,946 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:39:49,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:39:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:39:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:39:49,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,947 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 10:39:49,947 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-08-05 10:39:49,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,731 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 10:39:51,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:39:51,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:39:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:39:51,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:39:51,733 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 10:39:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,948 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:39:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:39:51,949 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 10:39:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,950 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:39:51,950 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:39:51,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:39:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:39:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 10:39:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:39:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 10:39:51,954 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 10:39:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,954 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 10:39:51,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:39:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 10:39:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:39:51,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,955 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 10:39:51,956 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,956 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-08-05 10:39:51,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,998 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 10:39:53,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:39:53,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:39:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:39:54,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:39:54,000 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 10:39:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:54,219 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:39:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:39:54,219 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 10:39:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:54,220 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:39:54,220 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:39:54,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:39:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:39:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 10:39:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:39:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:39:54,223 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 10:39:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:54,224 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:39:54,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:39:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:39:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:39:54,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:54,224 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 10:39:54,225 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-08-05 10:39:54,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:54,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:39:54,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,067 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 10:39:56,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:39:56,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:39:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:39:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:39:56,069 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 10:39:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,267 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:39:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:39:56,268 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 10:39:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,269 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:39:56,269 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:39:56,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:39:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:39:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 10:39:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:39:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 10:39:56,273 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 10:39:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,273 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 10:39:56,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:39:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 10:39:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:39:56,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,274 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 10:39:56,274 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-08-05 10:39:56,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,521 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 10:39:58,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:39:58,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:39:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:39:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:39:58,522 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 10:39:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,746 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:39:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:39:58,746 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 10:39:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,748 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:39:58,748 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:39:58,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:39:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:39:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:39:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:39:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:39:58,751 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 10:39:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,752 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:39:58,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:39:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:39:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:39:58,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,753 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 10:39:58,753 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-08-05 10:39:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:00,800 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 10:40:00,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:00,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:40:00,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:40:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:40:00,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:40:00,801 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 10:40:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,034 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:40:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:40:01,034 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 10:40:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,035 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:40:01,035 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:40:01,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:40:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:40:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 10:40:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:40:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:40:01,038 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 10:40:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,038 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:40:01,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:40:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:40:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:40:01,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,039 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 10:40:01,040 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-08-05 10:40:01,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:01,345 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:40:03,701 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 10:40:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:40:03,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:40:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:40:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:40:03,703 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 10:40:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:03,926 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-08-05 10:40:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:40:03,927 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 10:40:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:03,928 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:40:03,928 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:40:03,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:40:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:40:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 10:40:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:40:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 10:40:03,932 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 10:40:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:03,932 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 10:40:03,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:40:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 10:40:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:40:03,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:03,933 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 10:40:03,933 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-08-05 10:40:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:03,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:40:03,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:07,896 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 10:40:07,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:07,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:40:07,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:40:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:40:07,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:40:07,898 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 10:40:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:08,277 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:40:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:40:08,278 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 10:40:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:08,280 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:40:08,280 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:40:08,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:40:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:40:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 10:40:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:40:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 10:40:08,283 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 10:40:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:08,284 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 10:40:08,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:40:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 10:40:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:40:08,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:08,284 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 10:40:08,285 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-08-05 10:40:08,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:08,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:40:08,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:10,459 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 10:40:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:40:10,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:40:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:40:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:40:10,461 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 10:40:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:11,000 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:40:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:40:11,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 10:40:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:11,002 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:40:11,002 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:40:11,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:40:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:40:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:40:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:40:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:40:11,006 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 10:40:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:11,006 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:40:11,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:40:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:40:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:40:11,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:11,007 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 10:40:11,007 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:11,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2019-08-05 10:40:11,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:11,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:40:11,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:13,239 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 10:40:13,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:13,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:40:13,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:40:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:40:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:40:13,241 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 10:40:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:13,590 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:40:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:40:13,590 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 10:40:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:13,592 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:40:13,592 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:40:13,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:40:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:40:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 10:40:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:40:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 10:40:13,594 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 10:40:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:13,595 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 10:40:13,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:40:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 10:40:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:40:13,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:13,595 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 10:40:13,596 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2019-08-05 10:40:13,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:13,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:40:13,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:15,828 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 10:40:15,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:15,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:40:15,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:40:15,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:40:15,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:40:15,829 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 10:40:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:16,056 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-08-05 10:40:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:40:16,057 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 10:40:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:16,058 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:40:16,058 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:40:16,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:40:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:40:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 10:40:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:40:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 10:40:16,061 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 10:40:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:16,062 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 10:40:16,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:40:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 10:40:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:40:16,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:16,062 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 10:40:16,063 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2019-08-05 10:40:16,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:16,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:40:16,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:18,768 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 10:40:18,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:18,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:40:18,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:40:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:40:18,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:40:18,769 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 10:40:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:19,063 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:40:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:40:19,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 10:40:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:19,064 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:40:19,064 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:40:19,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:40:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:40:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 10:40:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:40:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:40:19,067 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 10:40:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:19,068 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:40:19,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:40:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:40:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:40:19,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:19,069 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 10:40:19,070 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2019-08-05 10:40:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:40:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:21,428 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 10:40:21,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:21,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:40:21,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:40:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:40:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:40:21,430 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 10:40:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:21,685 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:40:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:40:21,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 10:40:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:21,686 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:40:21,687 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:40:21,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:40:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:40:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:40:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:40:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:40:21,691 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 10:40:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:21,691 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:40:21,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:40:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:40:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:40:21,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:21,692 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 10:40:21,693 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2019-08-05 10:40:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:21,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:40:21,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:25,302 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 10:40:25,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:25,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:40:25,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:40:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:40:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:40:25,303 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 10:40:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:25,546 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:40:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:40:25,547 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 10:40:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:25,548 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:40:25,548 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:40:25,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:40:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:40:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 10:40:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:40:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 10:40:25,551 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 10:40:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:25,552 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 10:40:25,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:40:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 10:40:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:40:25,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:25,553 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 10:40:25,553 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2019-08-05 10:40:25,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:25,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:40:25,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:28,108 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 10:40:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:28,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:40:28,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:40:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:40:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:40:28,110 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 10:40:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:28,443 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-05 10:40:28,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:40:28,443 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 10:40:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:28,445 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:40:28,445 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:40:28,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:40:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:40:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 10:40:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:40:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:40:28,448 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 10:40:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:28,448 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:40:28,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:40:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:40:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:40:28,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:28,449 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 10:40:28,449 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2019-08-05 10:40:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:28,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:40:28,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:31,644 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 10:40:31,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:40:31,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:40:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:40:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:40:31,646 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 10:40:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:31,882 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:40:31,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:40:31,883 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 10:40:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:31,884 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:40:31,884 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:40:31,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:40:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:40:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:40:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:40:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 10:40:31,887 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 10:40:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:31,887 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 10:40:31,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:40:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 10:40:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:40:31,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:31,888 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 10:40:31,888 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2019-08-05 10:40:31,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:31,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:40:31,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:34,900 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 10:40:34,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:34,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:40:34,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:40:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:40:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:40:34,902 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 10:40:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:35,161 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-08-05 10:40:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:40:35,161 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 10:40:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:35,162 INFO L225 Difference]: With dead ends: 156 [2019-08-05 10:40:35,163 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:40:35,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:40:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:40:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 10:40:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:40:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 10:40:35,166 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 10:40:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:35,166 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 10:40:35,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:40:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 10:40:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:40:35,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:35,167 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 10:40:35,167 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2019-08-05 10:40:35,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:35,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:40:35,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:37,766 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 10:40:37,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:37,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:40:37,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:40:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:40:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:40:37,768 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 10:40:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:38,020 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:40:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:40:38,021 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 10:40:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:38,022 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:40:38,022 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:40:38,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:40:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:40:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 10:40:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:40:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:40:38,026 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 10:40:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:38,026 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:40:38,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:40:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:40:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:40:38,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:38,027 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 10:40:38,027 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2019-08-05 10:40:38,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:38,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:40:38,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,945 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 10:40:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:40,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:40:40,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:40:40,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:40:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:40:40,946 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 10:40:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:41,203 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-08-05 10:40:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:40:41,203 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 10:40:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:41,205 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:40:41,205 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:40:41,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:40:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:40:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:40:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:40:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 10:40:41,209 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 10:40:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:41,209 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 10:40:41,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:40:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 10:40:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:40:41,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:41,210 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 10:40:41,210 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2019-08-05 10:40:41,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:41,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:40:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:44,192 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 10:40:44,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:44,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:40:44,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:40:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:40:44,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:40:44,194 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 10:40:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:44,518 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:40:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:40:44,518 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 10:40:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:44,519 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:40:44,519 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:40:44,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:40:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:40:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 10:40:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:40:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 10:40:44,522 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 10:40:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:44,523 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 10:40:44,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:40:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 10:40:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:40:44,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:44,524 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 10:40:44,524 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2019-08-05 10:40:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:44,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:40:44,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:47,370 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 10:40:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:40:47,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:40:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:40:47,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:40:47,372 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 10:40:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:47,638 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:40:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:40:47,639 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 10:40:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:47,640 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:40:47,640 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:40:47,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:40:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:40:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:40:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:40:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:40:47,644 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 10:40:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:47,644 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:40:47,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:40:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:40:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:40:47,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:47,645 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 10:40:47,645 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2019-08-05 10:40:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:47,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:40:47,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,614 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 10:40:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:40:50,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:40:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:40:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:40:50,615 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 10:40:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:50,882 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:40:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:40:50,883 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 10:40:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:50,884 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:40:50,884 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:40:50,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:40:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:40:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 10:40:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:40:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 10:40:50,887 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 10:40:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:50,888 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 10:40:50,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:40:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 10:40:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:40:50,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:50,889 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 10:40:50,889 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2019-08-05 10:40:50,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:40:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,849 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 10:40:53,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:40:53,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:40:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:40:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:40:53,851 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 10:40:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:54,142 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 10:40:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:40:54,143 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 10:40:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:54,144 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:40:54,144 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:40:54,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:40:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:40:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 10:40:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:40:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 10:40:54,148 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 10:40:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:54,148 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 10:40:54,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:40:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 10:40:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:40:54,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:54,149 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 10:40:54,149 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:54,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:54,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2019-08-05 10:40:54,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:54,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:40:54,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,772 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 10:40:57,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:40:57,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:40:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:40:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:40:57,773 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 10:40:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:58,053 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:40:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:40:58,054 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 10:40:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:58,055 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:40:58,055 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:40:58,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:40:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:40:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 10:40:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:40:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 10:40:58,058 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 10:40:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:58,059 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 10:40:58,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:40:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 10:40:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:40:58,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:58,060 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 10:40:58,060 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2019-08-05 10:40:58,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:58,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:40:58,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:01,527 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 10:41:01,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:41:01,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:41:01,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:41:01,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:41:01,528 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 10:41:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,808 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-08-05 10:41:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:41:01,808 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 10:41:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,810 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:41:01,810 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:41:01,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:41:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:41:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 10:41:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:41:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 10:41:01,814 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 10:41:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,815 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 10:41:01,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:41:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 10:41:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:41:01,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,816 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 10:41:01,816 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2019-08-05 10:41:01,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:05,297 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 10:41:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:41:05,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:41:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:41:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:41:05,299 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 10:41:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:05,583 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:41:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:41:05,583 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 10:41:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:05,585 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:41:05,585 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:41:05,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:41:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:41:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 10:41:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:41:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 10:41:05,588 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 10:41:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:05,589 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 10:41:05,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:41:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 10:41:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:41:05,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:05,590 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 10:41:05,590 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2019-08-05 10:41:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:05,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:41:05,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:08,867 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 10:41:08,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:08,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:41:08,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:41:08,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:41:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:41:08,869 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 10:41:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:09,160 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-05 10:41:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:41:09,160 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 10:41:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:09,161 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:41:09,162 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:41:09,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:41:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:41:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:41:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:41:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 10:41:09,167 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 10:41:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:09,168 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 10:41:09,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:41:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 10:41:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:41:09,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:09,169 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 10:41:09,170 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2019-08-05 10:41:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:09,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:41:09,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,892 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 10:41:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:41:12,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:41:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:41:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:41:12,894 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 10:41:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:13,181 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:41:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:41:13,182 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 10:41:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:13,183 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:41:13,183 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:41:13,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:41:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:41:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 10:41:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:41:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 10:41:13,186 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 10:41:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:13,187 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 10:41:13,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:41:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 10:41:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:41:13,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:13,188 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 10:41:13,188 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2019-08-05 10:41:13,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:16,797 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 10:41:16,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:16,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:41:16,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:41:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:41:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:41:16,798 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 10:41:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:17,103 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 10:41:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:41:17,104 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 10:41:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:17,105 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:41:17,105 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:41:17,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:41:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:41:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:41:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:41:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:41:17,109 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 10:41:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:17,109 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:41:17,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:41:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:41:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:41:17,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:17,110 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 10:41:17,110 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2019-08-05 10:41:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:17,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:41:17,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:20,782 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 10:41:20,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:20,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:41:20,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:41:20,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:41:20,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:41:20,783 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 10:41:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:21,072 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:41:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:41:21,073 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 10:41:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:21,074 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:41:21,074 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:41:21,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:41:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:41:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 10:41:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:41:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 10:41:21,077 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 10:41:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:21,077 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 10:41:21,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:41:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 10:41:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:41:21,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:21,078 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2019-08-05 10:41:21,078 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2019-08-05 10:41:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:21,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:41:21,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:24,562 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 10:41:24,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:41:24,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:41:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:41:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:41:24,563 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 10:41:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,866 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2019-08-05 10:41:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:41:24,866 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 10:41:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,868 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:41:24,868 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:41:24,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:41:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:41:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:41:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:41:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 10:41:24,870 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 10:41:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:24,871 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 10:41:24,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:41:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 10:41:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:41:24,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:24,872 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2019-08-05 10:41:24,872 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2019-08-05 10:41:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:24,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:41:24,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:28,656 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 10:41:28,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:28,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:41:28,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:41:28,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:41:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:41:28,657 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 10:41:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:28,993 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 10:41:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:41:28,994 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 10:41:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:28,995 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:41:28,995 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:41:28,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:41:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:41:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 10:41:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:41:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 10:41:28,999 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 10:41:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:29,000 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 10:41:29,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:41:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 10:41:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:41:29,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:29,001 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2019-08-05 10:41:29,001 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2019-08-05 10:41:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:29,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:41:29,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:32,852 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 10:41:32,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:32,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:41:32,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:41:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:41:32,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:41:32,854 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 10:41:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:33,174 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-08-05 10:41:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:41:33,174 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 10:41:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:33,175 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:41:33,175 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:41:33,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:41:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:41:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:41:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:41:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 10:41:33,179 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 10:41:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:33,179 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 10:41:33,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:41:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 10:41:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:41:33,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:33,181 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2019-08-05 10:41:33,181 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2019-08-05 10:41:33,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:33,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:41:33,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:37,356 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 10:41:37,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:37,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:41:37,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:41:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:41:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:41:37,358 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 10:41:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:37,686 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-05 10:41:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:41:37,686 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 10:41:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:37,688 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:41:37,688 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:41:37,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:41:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:41:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 10:41:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:41:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 10:41:37,692 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 10:41:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:37,692 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 10:41:37,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:41:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 10:41:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:41:37,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:37,693 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2019-08-05 10:41:37,693 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2019-08-05 10:41:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:37,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:41:37,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:41,886 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 10:41:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:41,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:41:41,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:41:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:41:41,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:41:41,888 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 10:41:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:42,201 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-08-05 10:41:42,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:41:42,202 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 10:41:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:42,203 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:41:42,203 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:41:42,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:41:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:41:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 10:41:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:41:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 10:41:42,206 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 10:41:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:42,207 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 10:41:42,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:41:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 10:41:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 10:41:42,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:42,207 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2019-08-05 10:41:42,208 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2019-08-05 10:41:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:42,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:41:42,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:46,352 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 10:41:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:46,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:41:46,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:41:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:41:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:41:46,354 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 10:41:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:46,679 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:41:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:41:46,680 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 10:41:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:46,681 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:41:46,681 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:41:46,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:41:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:41:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 10:41:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:41:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 10:41:46,685 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 10:41:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:46,685 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 10:41:46,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:41:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 10:41:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:41:46,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:46,686 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2019-08-05 10:41:46,686 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2019-08-05 10:41:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:46,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:41:46,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:50,655 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 10:41:50,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:50,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:41:50,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:41:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:41:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:41:50,657 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 10:41:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:51,050 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:41:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:41:51,051 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 10:41:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:51,052 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:41:51,052 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:41:51,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:41:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:41:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:41:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:41:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:41:51,054 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 10:41:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:51,054 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:41:51,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:41:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:41:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:41:51,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:51,056 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2019-08-05 10:41:51,056 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2019-08-05 10:41:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:51,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:41:51,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:55,128 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 10:41:55,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:41:55,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:41:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:41:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:41:55,129 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 10:41:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:55,469 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 10:41:55,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:41:55,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 10:41:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:55,471 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:41:55,471 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:41:55,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:41:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:41:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 10:41:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:41:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 10:41:55,473 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 10:41:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:55,474 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 10:41:55,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:41:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 10:41:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:41:55,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:55,475 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2019-08-05 10:41:55,475 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2019-08-05 10:41:55,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:55,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:41:55,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:59,743 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 10:41:59,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:59,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:41:59,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:41:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:41:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:41:59,744 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 10:42:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:00,073 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-08-05 10:42:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:42:00,073 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 10:42:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:00,075 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:42:00,075 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:42:00,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:42:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:42:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 10:42:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:42:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 10:42:00,078 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 10:42:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:00,079 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 10:42:00,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:42:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 10:42:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:42:00,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:00,080 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2019-08-05 10:42:00,080 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2019-08-05 10:42:00,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:00,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:42:00,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:04,511 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 10:42:04,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:42:04,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:42:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:42:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:42:04,512 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 10:42:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:04,835 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-05 10:42:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:42:04,836 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 10:42:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:04,837 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:42:04,837 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:42:04,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:42:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:42:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 10:42:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:42:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 10:42:04,840 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 10:42:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:04,840 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 10:42:04,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:42:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 10:42:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 10:42:04,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:04,841 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2019-08-05 10:42:04,841 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2019-08-05 10:42:04,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:42:04,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:09,434 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 10:42:09,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:09,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:42:09,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:42:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:42:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:42:09,436 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 10:42:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:09,783 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-08-05 10:42:09,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:42:09,784 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 10:42:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:09,785 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:42:09,785 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:42:09,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:42:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:42:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 10:42:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:42:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 10:42:09,788 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 10:42:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:09,789 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 10:42:09,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:42:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 10:42:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:42:09,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:09,790 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2019-08-05 10:42:09,790 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2019-08-05 10:42:09,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:09,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:42:09,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:14,419 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 10:42:14,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:14,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:42:14,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:42:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:42:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:42:14,421 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 10:42:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:14,775 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-05 10:42:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:42:14,775 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 10:42:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:14,777 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:42:14,777 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:42:14,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:42:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:42:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 10:42:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:42:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 10:42:14,781 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 10:42:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:14,781 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 10:42:14,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:42:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 10:42:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 10:42:14,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:14,782 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2019-08-05 10:42:14,783 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2019-08-05 10:42:14,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:14,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:42:14,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,531 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 10:42:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:19,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:42:19,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:42:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:42:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:42:19,533 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2019-08-05 10:42:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,879 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2019-08-05 10:42:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:42:19,880 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2019-08-05 10:42:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,881 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:42:19,881 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:42:19,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:42:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:42:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-08-05 10:42:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:42:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 10:42:19,885 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 10:42:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,885 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 10:42:19,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:42:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 10:42:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:42:19,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,886 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2019-08-05 10:42:19,886 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2019-08-05 10:42:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,648 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 10:42:24,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:24,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:42:24,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:42:24,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:42:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:42:24,650 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2019-08-05 10:42:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:24,990 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-05 10:42:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:42:24,990 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2019-08-05 10:42:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:24,991 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:42:24,991 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:42:24,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:42:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:42:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-08-05 10:42:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 10:42:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 10:42:24,993 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 10:42:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:24,994 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 10:42:24,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:42:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 10:42:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 10:42:24,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:24,994 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2019-08-05 10:42:24,995 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2019-08-05 10:42:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,926 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 10:42:29,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:42:29,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:42:29,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:42:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:42:29,928 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2019-08-05 10:42:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,342 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-08-05 10:42:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:42:30,343 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2019-08-05 10:42:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,344 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:42:30,344 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:42:30,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:42:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:42:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 10:42:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:42:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 10:42:30,348 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 10:42:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,348 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 10:42:30,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:42:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 10:42:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 10:42:30,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,349 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2019-08-05 10:42:30,349 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2019-08-05 10:42:30,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:35,355 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 10:42:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:42:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:42:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:42:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:42:35,357 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2019-08-05 10:42:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:35,736 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-08-05 10:42:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:42:35,736 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2019-08-05 10:42:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:35,737 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:42:35,737 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:42:35,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:42:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:42:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-08-05 10:42:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 10:42:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 10:42:35,741 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 10:42:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:35,742 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 10:42:35,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:42:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 10:42:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 10:42:35,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:35,743 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2019-08-05 10:42:35,743 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2019-08-05 10:42:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:35,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:42:35,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:40,903 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 10:42:40,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:42:40,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:42:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:42:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:42:40,905 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2019-08-05 10:42:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:41,295 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-08-05 10:42:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:42:41,296 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2019-08-05 10:42:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:41,297 INFO L225 Difference]: With dead ends: 216 [2019-08-05 10:42:41,297 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 10:42:41,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:42:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 10:42:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-08-05 10:42:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 10:42:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 10:42:41,301 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 10:42:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:41,301 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 10:42:41,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:42:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 10:42:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 10:42:41,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:41,302 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2019-08-05 10:42:41,303 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2019-08-05 10:42:41,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:41,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:42:41,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:46,452 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 10:42:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:42:46,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:42:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:42:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:42:46,454 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2019-08-05 10:42:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:46,847 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-05 10:42:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:42:46,847 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2019-08-05 10:42:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:46,848 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:42:46,848 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:42:46,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:42:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:42:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-08-05 10:42:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 10:42:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 10:42:46,850 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 10:42:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:46,851 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 10:42:46,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:42:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 10:42:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:42:46,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:46,851 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2019-08-05 10:42:46,852 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2019-08-05 10:42:46,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:46,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:42:46,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:42:50,667 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:42:50,667 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:42:50,672 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:42:50,672 INFO L202 PluginConnector]: Adding new model LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:42:50 BoogieIcfgContainer [2019-08-05 10:42:50,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:42:50,674 INFO L168 Benchmark]: Toolchain (without parser) took 242015.56 ms. Allocated memory was 142.1 MB in the beginning and 363.9 MB in the end (delta: 221.8 MB). Free memory was 111.6 MB in the beginning and 267.0 MB in the end (delta: -155.5 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,675 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.40 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,676 INFO L168 Benchmark]: Boogie Preprocessor took 19.53 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,676 INFO L168 Benchmark]: RCFGBuilder took 279.02 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,677 INFO L168 Benchmark]: TraceAbstraction took 241678.89 ms. Allocated memory was 142.1 MB in the beginning and 363.9 MB in the end (delta: 221.8 MB). Free memory was 99.2 MB in the beginning and 267.0 MB in the end (delta: -167.8 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:50,680 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.22 ms. Allocated memory is still 142.1 MB. Free memory was 112.8 MB in the beginning and 112.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.40 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 109.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.53 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 279.02 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241678.89 ms. Allocated memory was 142.1 MB in the beginning and 363.9 MB in the end (delta: 221.8 MB). Free memory was 99.2 MB in the beginning and 267.0 MB in the end (delta: -167.8 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 218 with TraceHistMax 108,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 241.6s OverallTime, 108 OverallIterations, 108 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 12662 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11556 GetRequests, 5778 SyntacticMatches, 0 SemanticMatches, 5778 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 207.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=107, 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, 107 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 212.6s InterpolantComputationTime, 11663 NumberOfCodeBlocks, 11663 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 11556 ConstructedInterpolants, 0 QuantifiedInterpolants, 11594520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 23540 ConjunctsInSsa, 5992 ConjunctsInUnsatCore, 107 InterpolantComputations, 1 PerfectInterpolantSequences, 0/408312 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown