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/abstractInterpretation/regression/non_taipan/loop-nested-assume-unsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:29,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:29,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:29,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:29,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:29,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:29,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:29,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:29,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:29,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:29,725 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:29,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:29,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:29,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:29,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:29,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:29,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:29,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:29,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:29,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:29,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:29,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:29,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:29,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:29,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:29,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:29,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:29,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:29,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:29,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:29,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:29,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:29,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:29,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:29,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:29,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:29,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:29,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:29,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:29,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:29,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:29,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:29,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:29,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:29,828 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:29,828 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:29,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-nested-assume-unsafe.bpl [2019-08-05 11:12:29,830 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-nested-assume-unsafe.bpl' [2019-08-05 11:12:29,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:29,866 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:29,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:29,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:29,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:29,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:29,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:29,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:29,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:29,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... [2019-08-05 11:12:29,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:29,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:29,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:29,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:29,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:12:29,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:12:29,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:12:29,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:12:30,332 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:12:30,332 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 11:12:30,334 INFO L202 PluginConnector]: Adding new model loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:30 BoogieIcfgContainer [2019-08-05 11:12:30,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:30,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:30,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:30,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:30,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:29" (1/2) ... [2019-08-05 11:12:30,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ae8c0 and model type loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:30, skipping insertion in model container [2019-08-05 11:12:30,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:30" (2/2) ... [2019-08-05 11:12:30,342 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-nested-assume-unsafe.bpl [2019-08-05 11:12:30,352 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:30,360 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:12:30,379 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:12:30,409 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:30,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:30,410 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:30,410 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:30,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:30,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:30,410 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:30,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:30,411 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:12:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:30,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:30,449 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash 30458, now seen corresponding path program 1 times [2019-08-05 11:12:30,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:12:30,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:30,634 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:12:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,666 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:12:30,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:30,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:12:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,679 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:12:30,679 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:12:30,681 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 11:12:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:12:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-08-05 11:12:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:12:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:12:30,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:12:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,716 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:12:30,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:12:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:30,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:30,717 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 11:12:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:12:30,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:30,838 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:12:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,964 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:12:30,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:30,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:12:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,967 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:12:30,967 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:12:30,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:12:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:12:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:12:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:12:30,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 3 [2019-08-05 11:12:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,971 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:12:30,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:12:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:30,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:12:30,972 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 28887366, now seen corresponding path program 1 times [2019-08-05 11:12:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:31,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:31,052 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 11:12:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,111 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:12:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:12:31,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:12:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,113 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:12:31,113 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:12:31,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:12:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 11:12:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:12:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:12:31,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 11:12:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,116 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:12:31,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:12:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:31,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,117 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:12:31,118 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash 28886956, now seen corresponding path program 1 times [2019-08-05 11:12:31,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:31,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:31,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:31,184 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 11:12:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,344 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:12:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:31,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:12:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,345 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:12:31,345 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:12:31,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:12:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:12:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:12:31,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2019-08-05 11:12:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,349 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:12:31,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:12:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:12:31,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,350 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:12:31,351 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1990572178, now seen corresponding path program 2 times [2019-08-05 11:12:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:31,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:31,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:31,439 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2019-08-05 11:12:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,547 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:12:31,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:31,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:12:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,548 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:12:31,549 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:12:31,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:12:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 11:12:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:12:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:12:31,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-05 11:12:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,552 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:12:31,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:12:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:12:31,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,553 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:12:31,554 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1990571768, now seen corresponding path program 2 times [2019-08-05 11:12:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:12:31,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:31,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:31,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:31,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:31,746 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-08-05 11:12:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,850 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:12:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:31,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:12:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,851 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:12:31,852 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:12:31,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:12:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:12:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:12:31,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:12:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,855 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:12:31,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:12:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:12:31,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,856 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:12:31,856 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1679033566, now seen corresponding path program 3 times [2019-08-05 11:12:31,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:32,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:32,028 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 11:12:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,088 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:12:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:32,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:12:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,089 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:12:32,089 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:12:32,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:12:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:12:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:12:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:12:32,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:12:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,092 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:12:32,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:12:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:12:32,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,093 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:12:32,093 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1356829142, now seen corresponding path program 4 times [2019-08-05 11:12:32,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:12:32,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:32,181 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 11:12:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,227 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:12:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:32,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:12:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,228 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:12:32,228 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:12:32,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:12:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:12:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:12:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:12:32,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:12:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,232 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:12:32,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:12:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:12:32,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,233 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:12:32,233 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1756869750, now seen corresponding path program 5 times [2019-08-05 11:12:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:32,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:12:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:12:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:32,350 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 11:12:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,507 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:12:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:12:32,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:12:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,509 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:12:32,509 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:12:32,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:12:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:12:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:12:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:12:32,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:12:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,515 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:12:32,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:12:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:12:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:12:32,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,516 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:12:32,516 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 429299650, now seen corresponding path program 6 times [2019-08-05 11:12:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:12:32,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:12:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:12:32,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:32,786 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 11:12:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,897 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:12:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:12:32,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:12:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,899 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:12:32,899 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:12:32,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:12:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:12:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:12:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:12:32,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:12:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,904 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:12:32,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:12:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:12:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:12:32,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,905 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:12:32,905 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash 239720462, now seen corresponding path program 7 times [2019-08-05 11:12:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:12:33,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:33,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:33,070 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 11:12:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,130 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:12:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:12:33,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:12:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,131 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:12:33,132 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:12:33,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:12:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:12:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:12:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:12:33,135 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:12:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,136 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:12:33,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:12:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:12:33,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,137 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:12:33,137 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1557252774, now seen corresponding path program 8 times [2019-08-05 11:12:33,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:33,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:12:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:12:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:33,298 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 11:12:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,379 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:12:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:12:33,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:12:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,380 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:12:33,381 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:12:33,381 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 11:12:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:12:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:12:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:12:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:12:33,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:12:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,385 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:12:33,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:12:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:12:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:33,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,387 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:12:33,387 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1871679578, now seen corresponding path program 9 times [2019-08-05 11:12:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:12:33,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:33,575 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 11:12:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,691 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:12:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:33,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:12:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,692 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:12:33,692 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:12:33,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:12:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:12:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:12:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:12:33,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:12:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,696 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:12:33,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:12:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:12:33,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,697 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:12:33,697 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash 906839794, now seen corresponding path program 10 times [2019-08-05 11:12:33,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:33,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:33,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:12:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:12:33,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:33,874 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 11:12:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,951 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:12:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:12:33,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 11:12:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,953 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:12:33,953 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:12:33,954 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 11:12:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:12:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:12:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:12:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:12:33,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:12:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,957 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:12:33,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:12:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:12:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:12:33,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,959 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:12:33,959 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash -405701826, now seen corresponding path program 11 times [2019-08-05 11:12:33,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:34,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:12:34,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:34,118 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 11:12:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,314 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:12:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:34,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 11:12:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,315 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:12:34,316 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:12:34,316 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 11:12:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:12:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:12:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:12:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:12:34,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:12:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,319 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:12:34,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:12:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:12:34,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,321 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 11:12:34,321 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,321 INFO L82 PathProgramCache]: Analyzing trace with hash 962186378, now seen corresponding path program 12 times [2019-08-05 11:12:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:34,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:12:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:12:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:34,654 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 11:12:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,981 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:12:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:12:34,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 11:12:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,982 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:12:34,982 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:12:34,983 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 11:12:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:12:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:12:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:12:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:12:34,987 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:12:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,988 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:12:34,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:12:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:12:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:12:34,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,989 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 11:12:34,989 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1242757846, now seen corresponding path program 13 times [2019-08-05 11:12:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:12:35,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:35,350 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 11:12:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,444 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:12:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:35,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 11:12:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,446 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:12:35,446 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:12:35,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:12:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:12:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:12:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:12:35,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:12:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,451 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:12:35,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:12:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:12:35,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,453 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 11:12:35,453 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 288998946, now seen corresponding path program 14 times [2019-08-05 11:12:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:35,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:35,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:35,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:35,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:35,817 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 11:12:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,872 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:12:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:35,874 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 11:12:35,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,875 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:12:35,875 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:12:35,876 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 11:12:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:12:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:12:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:12:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:12:35,879 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:12:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,879 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:12:35,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:12:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:12:35,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,880 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 11:12:35,881 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1445269906, now seen corresponding path program 15 times [2019-08-05 11:12:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:36,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:36,116 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 11:12:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,222 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:12:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:36,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 11:12:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,224 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:12:36,224 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:12:36,225 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 11:12:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:12:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:12:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:12:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:12:36,228 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:12:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,228 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:12:36,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:12:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:12:36,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,229 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 11:12:36,230 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1630325830, now seen corresponding path program 16 times [2019-08-05 11:12:36,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:36,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:36,825 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 11:12:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,911 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:12:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:36,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 11:12:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,912 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:12:36,912 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:12:36,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:12:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:12:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:12:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:12:36,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:12:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,918 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:12:36,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:12:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:36,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,919 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 11:12:36,919 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash 919557638, now seen corresponding path program 17 times [2019-08-05 11:12:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:37,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:37,313 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 11:12:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,418 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:12:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:37,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 11:12:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,424 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:12:37,424 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:12:37,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:12:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:12:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:12:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:12:37,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:12:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,428 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:12:37,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:12:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:12:37,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,429 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 11:12:37,430 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1068755630, now seen corresponding path program 18 times [2019-08-05 11:12:37,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:37,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:37,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,652 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 11:12:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,730 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:12:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:37,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 11:12:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,734 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:12:37,734 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:12:37,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:12:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:12:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:12:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:12:37,737 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:12:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,737 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:12:37,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:12:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:12:37,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,738 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 11:12:37,739 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -577359458, now seen corresponding path program 19 times [2019-08-05 11:12:37,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:38,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:12:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:12:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:38,155 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 11:12:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,224 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:12:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:12:38,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 11:12:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,226 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:12:38,226 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:12:38,227 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 11:12:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:12:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:12:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:12:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:12:38,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:12:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,231 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:12:38,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:12:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:12:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:12:38,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,232 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 11:12:38,232 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash -792040726, now seen corresponding path program 20 times [2019-08-05 11:12:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:12:38,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:12:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:12:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:38,637 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 11:12:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,724 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:12:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:12:38,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 11:12:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,726 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:12:38,726 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:12:38,727 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 11:12:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:12:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:12:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:12:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:12:38,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:12:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,730 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:12:38,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:12:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:12:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:38,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,731 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 11:12:38,731 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash -942309066, now seen corresponding path program 21 times [2019-08-05 11:12:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:39,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:12:39,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:12:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:12:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:39,380 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 11:12:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,556 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:12:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:12:39,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 11:12:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,557 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:12:39,557 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:12:39,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:12:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:12:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:12:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:12:39,562 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:12:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,562 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:12:39,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:12:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:12:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:12:39,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,563 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 11:12:39,564 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash 678704258, now seen corresponding path program 22 times [2019-08-05 11:12:39,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:12:39,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:12:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:12:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:39,967 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 11:12:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,059 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:12:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:12:40,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 11:12:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,060 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:12:40,061 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:12:40,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:12:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:12:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:12:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:12:40,065 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:12:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,065 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:12:40,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:12:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:12:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:12:40,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,066 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 11:12:40,067 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -600619826, now seen corresponding path program 23 times [2019-08-05 11:12:40,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:40,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:12:40,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:12:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:12:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:40,648 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 11:12:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,754 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:12:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:12:40,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 11:12:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,755 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:12:40,756 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:12:40,756 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 11:12:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:12:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:12:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:12:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:12:40,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:12:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,759 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:12:40,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:12:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:12:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:12:40,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,760 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 11:12:40,760 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1670417894, now seen corresponding path program 24 times [2019-08-05 11:12:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:12:41,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:41,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:41,663 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 11:12:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,744 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:12:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:41,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 11:12:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,745 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:12:41,746 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:12:41,746 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 11:12:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:12:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:12:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:12:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:12:41,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:12:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,750 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:12:41,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:12:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:41,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,751 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 11:12:41,751 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1045789798, now seen corresponding path program 25 times [2019-08-05 11:12:41,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:42,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:42,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:42,612 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 11:12:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,696 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:12:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:42,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 11:12:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,697 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:12:42,697 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:12:42,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:12:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:12:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:12:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:12:42,700 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:12:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,701 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:12:42,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:12:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:12:42,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,701 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 11:12:42,701 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash -18734158, now seen corresponding path program 26 times [2019-08-05 11:12:42,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:43,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:43,119 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 11:12:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,331 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:12:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:43,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 11:12:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,332 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:12:43,333 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:12:43,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:12:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:12:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:12:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:12:43,336 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:12:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,337 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:12:43,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:12:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:12:43,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,337 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 11:12:43,338 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash -824039426, now seen corresponding path program 27 times [2019-08-05 11:12:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:44,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:44,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:12:44,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:12:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:44,539 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 11:12:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,624 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:12:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:12:44,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 11:12:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,627 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:12:44,627 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:12:44,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:12:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:12:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:12:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:12:44,631 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:12:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,631 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:12:44,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:12:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:12:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:12:44,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,632 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 11:12:44,633 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1628288694, now seen corresponding path program 28 times [2019-08-05 11:12:44,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:45,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:12:45,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:12:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:12:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:45,066 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 11:12:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,204 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:12:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:45,205 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 11:12:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,205 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:12:45,205 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:12:45,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:12:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:12:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:12:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:12:45,209 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:12:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,209 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:12:45,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:12:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:12:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:45,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,210 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 11:12:45,211 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1417721962, now seen corresponding path program 29 times [2019-08-05 11:12:45,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:45,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:12:45,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:12:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:12:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:12:45,819 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 11:12:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,990 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:12:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:12:45,990 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 11:12:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,991 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:12:45,991 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:45,992 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 11:12:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:12:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:12:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:12:45,994 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:12:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,995 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:12:45,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:12:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:12:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:12:45,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,996 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 11:12:45,996 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -926555422, now seen corresponding path program 30 times [2019-08-05 11:12:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:12:46,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:12:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:12:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:46,422 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 11:12:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,531 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:12:46,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:12:46,531 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 11:12:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,532 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:12:46,533 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:12:46,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:12:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:12:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:12:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:12:46,536 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:12:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,536 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:12:46,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:12:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:12:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:12:46,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,537 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 11:12:46,537 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1361913042, now seen corresponding path program 31 times [2019-08-05 11:12:46,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:47,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:12:47,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:12:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:12:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:47,022 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 11:12:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,162 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:12:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:12:47,163 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 11:12:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,164 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:47,164 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:47,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:12:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:12:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:12:47,167 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:12:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,167 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:12:47,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:12:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:12:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:12:47,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,168 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 11:12:47,168 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1166209146, now seen corresponding path program 32 times [2019-08-05 11:12:47,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:47,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:12:47,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:12:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:12:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:47,766 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 11:12:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,863 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:12:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:12:47,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 11:12:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,865 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:12:47,865 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:12:47,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:12:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:12:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:12:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:12:47,869 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:12:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,869 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:12:47,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:12:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:12:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:47,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,870 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 11:12:47,870 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash -259857722, now seen corresponding path program 33 times [2019-08-05 11:12:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:12:48,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:12:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:12:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:12:48,519 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 11:12:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,627 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:12:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:12:48,627 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 11:12:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,628 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:12:48,628 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:12:48,630 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 11:12:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:12:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:12:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:12:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:12:48,632 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:12:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,633 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:12:48,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:12:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:12:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:12:48,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,633 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 11:12:48,634 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash -615550446, now seen corresponding path program 34 times [2019-08-05 11:12:48,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:49,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:12:49,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:12:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:12:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:49,165 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 11:12:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,362 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:12:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:12:49,364 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 11:12:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,365 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:12:49,365 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:12:49,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:12:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 11:12:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:12:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:12:49,367 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:12:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,367 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:12:49,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:12:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:12:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:12:49,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,368 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 11:12:49,368 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1161125470, now seen corresponding path program 35 times [2019-08-05 11:12:49,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:12:50,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:12:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:12:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:50,775 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 11:12:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,883 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:12:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:12:50,884 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 11:12:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,885 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:12:50,885 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:12:50,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:12:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:12:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:12:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:12:50,888 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:12:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,888 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:12:50,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:12:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:12:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:12:50,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,889 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 11:12:50,889 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -850303062, now seen corresponding path program 36 times [2019-08-05 11:12:50,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:12:51,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:12:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:12:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:51,512 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 11:12:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,656 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:12:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:12:51,657 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 11:12:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,658 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:12:51,658 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:12:51,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:12:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:12:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:12:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:12:51,662 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:12:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,663 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:12:51,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:12:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:12:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:12:51,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,663 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 11:12:51,664 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1097839114, now seen corresponding path program 37 times [2019-08-05 11:12:51,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:52,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:12:52,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:12:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:12:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:52,255 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 11:12:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,359 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:12:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:12:52,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 11:12:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,361 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:12:52,361 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:12:52,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:12:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 11:12:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:12:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:12:52,364 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:12:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,364 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:12:52,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:12:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:12:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:12:52,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,364 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 11:12:52,365 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1538183490, now seen corresponding path program 38 times [2019-08-05 11:12:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:12:53,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:12:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:12:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:53,085 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 11:12:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,206 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:12:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:12:53,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 11:12:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,208 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:12:53,208 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:12:53,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:12:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 11:12:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:12:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:12:53,211 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:12:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,212 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:12:53,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:12:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:12:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:12:53,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,212 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 11:12:53,212 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash 725201294, now seen corresponding path program 39 times [2019-08-05 11:12:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:12:54,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:12:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:12:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:54,618 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 11:12:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,774 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:12:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:12:54,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 11:12:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,776 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:12:54,776 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:12:54,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:12:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:12:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:12:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:12:54,781 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:12:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,781 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:12:54,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:12:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:12:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:12:54,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,782 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 11:12:54,782 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1133358810, now seen corresponding path program 40 times [2019-08-05 11:12:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:12:55,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:12:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:12:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:55,829 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 11:12:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,952 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:12:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:12:55,953 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 11:12:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,954 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:12:55,954 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:12:55,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:12:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 11:12:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:12:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:12:55,958 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:12:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,959 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:12:55,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:12:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:12:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:12:55,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,960 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 11:12:55,960 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1764259546, now seen corresponding path program 41 times [2019-08-05 11:12:55,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:56,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:12:56,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:12:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:12:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:56,640 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 11:12:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,765 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:12:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:12:56,765 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 11:12:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,766 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:12:56,767 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:12:56,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:12:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 11:12:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:12:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:12:56,770 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:12:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,770 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:12:56,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:12:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:12:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:12:56,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,771 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 11:12:56,771 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1058275442, now seen corresponding path program 42 times [2019-08-05 11:12:56,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:57,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:12:57,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:12:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:12:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:57,553 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 11:12:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,709 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:12:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:12:57,709 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 11:12:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,710 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:12:57,710 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:12:57,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:12:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:12:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:12:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:12:57,714 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:12:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,714 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:12:57,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:12:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:12:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:12:57,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,715 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 11:12:57,715 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash -904932162, now seen corresponding path program 43 times [2019-08-05 11:12:57,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:12:58,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:12:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:12:58,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:58,592 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 11:12:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,747 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:12:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:12:58,748 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 11:12:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,749 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:12:58,749 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:12:58,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:12:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 11:12:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:12:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:12:58,752 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:12:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,753 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:12:58,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:12:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:12:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:12:58,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,753 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 11:12:58,754 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2056796662, now seen corresponding path program 44 times [2019-08-05 11:12:58,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:59,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:12:59,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:12:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:12:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:59,618 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 11:12:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,994 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:12:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:12:59,995 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 11:12:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,996 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:12:59,996 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:12:59,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:13:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:13:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:13:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:13:00,002 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:13:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,002 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:13:00,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:13:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:13:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:13:00,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,003 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 11:13:00,003 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash -897018794, now seen corresponding path program 45 times [2019-08-05 11:13:00,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:13:01,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:13:01,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:13:01,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:01,222 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 11:13:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,360 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:13:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:13:01,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 11:13:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,362 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:13:01,362 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:13:01,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:13:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:13:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:13:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:13:01,365 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:13:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,365 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:13:01,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:13:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:13:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:13:01,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,366 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 11:13:01,367 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1252982690, now seen corresponding path program 46 times [2019-08-05 11:13:01,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:02,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:13:02,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:13:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:13:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:13:02,274 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 11:13:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,414 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:13:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:13:02,414 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 11:13:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,416 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:13:02,416 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:13:02,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:13:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:13:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 11:13:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:13:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:13:02,419 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:13:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,420 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:13:02,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:13:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:13:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:13:02,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,421 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 11:13:02,421 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1525139438, now seen corresponding path program 47 times [2019-08-05 11:13:02,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:03,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:13:03,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:13:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:13:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:03,539 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 11:13:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,687 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:13:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:13:03,688 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 11:13:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,690 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:13:03,690 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:13:03,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:13:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 11:13:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:13:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:13:03,692 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:13:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,693 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:13:03,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:13:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:13:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:13:03,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,694 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 11:13:03,694 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1074769210, now seen corresponding path program 48 times [2019-08-05 11:13:03,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:13:04,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:13:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:13:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:04,701 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 11:13:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,851 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:13:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:13:04,852 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 11:13:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,853 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:13:04,853 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:13:04,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:13:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:13:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:13:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:13:04,857 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:13:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,857 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:13:04,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:13:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:13:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:04,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,858 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 11:13:04,858 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2060676998, now seen corresponding path program 49 times [2019-08-05 11:13:04,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:06,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:13:06,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:13:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:13:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:06,172 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 11:13:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,355 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:13:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:13:06,355 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 11:13:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,357 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:13:06,357 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:13:06,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:13:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:13:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:13:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:13:06,360 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:13:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,361 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:13:06,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:13:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:13:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:13:06,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,362 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 11:13:06,362 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 330288850, now seen corresponding path program 50 times [2019-08-05 11:13:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:07,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:13:07,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:13:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:13:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:07,867 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 11:13:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,752 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:13:08,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:13:08,752 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 11:13:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,754 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:13:08,754 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:13:08,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:13:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:13:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:13:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:13:08,757 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:13:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,757 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:13:08,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:13:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:13:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:13:08,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,758 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 11:13:08,759 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -420377826, now seen corresponding path program 51 times [2019-08-05 11:13:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:13:10,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:13:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:13:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:10,399 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 11:13:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,588 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:13:10,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:13:10,588 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 11:13:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,590 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:13:10,590 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:13:10,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:13:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 11:13:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:13:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:13:10,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 11:13:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,593 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:13:10,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:13:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:13:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:13:10,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,594 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 11:13:10,595 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash -256547734, now seen corresponding path program 52 times [2019-08-05 11:13:10,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:13:12,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:13:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:13:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:12,049 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 11:13:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,201 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:13:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:13:12,202 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 11:13:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,203 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:13:12,203 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:13:12,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:13:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 11:13:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:13:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:13:12,207 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 11:13:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,207 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:13:12,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:13:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:13:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:13:12,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,208 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 11:13:12,208 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1729619274, now seen corresponding path program 53 times [2019-08-05 11:13:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:13:13,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:13:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:13:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:13,378 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 11:13:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,626 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:13:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:13:13,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 11:13:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,628 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:13:13,629 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:13:13,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:13:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 11:13:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:13:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:13:13,631 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 11:13:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,631 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:13:13,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:13:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:13:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:13:13,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,632 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 11:13:13,633 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -12161534, now seen corresponding path program 54 times [2019-08-05 11:13:13,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:14,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:13:14,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:13:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:13:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:14,818 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 11:13:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,995 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:13:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:13:14,996 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 11:13:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,997 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:13:14,997 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:13:14,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:13:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:13:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:13:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:13:15,000 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 11:13:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,000 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:13:15,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:13:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:13:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:13:15,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,001 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 11:13:15,002 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1197284942, now seen corresponding path program 55 times [2019-08-05 11:13:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:16,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:13:16,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:13:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:13:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:13:16,529 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 11:13:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,814 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:13:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:13:16,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 11:13:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,815 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:13:16,815 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:13:16,816 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 11:13:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:13:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 11:13:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:13:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:13:16,818 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 11:13:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,819 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:13:16,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:13:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:13:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:13:16,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,820 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 11:13:16,820 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -460788838, now seen corresponding path program 56 times [2019-08-05 11:13:16,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:18,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:13:18,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:13:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:13:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:18,014 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 11:13:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,180 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:13:18,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:13:18,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 11:13:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,181 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:13:18,182 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:13:18,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:13:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 11:13:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:13:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:13:18,184 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 11:13:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,185 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:13:18,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:13:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:13:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:13:18,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,185 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 11:13:18,186 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,186 INFO L82 PathProgramCache]: Analyzing trace with hash -436824602, now seen corresponding path program 57 times [2019-08-05 11:13:18,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:19,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:13:19,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:13:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:13:19,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:19,583 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 11:13:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,748 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:13:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:13:19,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 11:13:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,749 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:13:19,750 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:13:19,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:13:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 11:13:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:13:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:13:19,753 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 11:13:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,753 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:13:19,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:13:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:13:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:13:19,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,754 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 11:13:19,754 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1117969714, now seen corresponding path program 58 times [2019-08-05 11:13:19,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:21,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:21,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:13:21,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:13:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:13:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:21,481 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 11:13:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:21,661 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:13:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:13:21,662 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 11:13:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:21,663 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:13:21,663 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:13:21,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:13:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 11:13:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:13:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:13:21,666 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 11:13:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:21,667 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:13:21,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:13:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:13:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:13:21,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:21,668 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 11:13:21,668 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 626688382, now seen corresponding path program 59 times [2019-08-05 11:13:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:21,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:13:21,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:23,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:13:23,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:13:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:13:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:23,442 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 11:13:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,620 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 11:13:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:13:23,620 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 11:13:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,621 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:13:23,622 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:13:23,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:13:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 11:13:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:13:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:13:23,625 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 11:13:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,625 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:13:23,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:13:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:13:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:13:23,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,626 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 11:13:23,626 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 951730890, now seen corresponding path program 60 times [2019-08-05 11:13:23,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:25,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:13:25,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:13:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:13:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:25,036 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 11:13:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,246 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:13:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:13:25,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 11:13:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,248 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:13:25,248 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:13:25,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:13:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 11:13:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:13:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:13:25,251 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 11:13:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:25,252 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:13:25,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:13:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:13:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:13:25,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:25,253 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 11:13:25,253 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -215031530, now seen corresponding path program 61 times [2019-08-05 11:13:25,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:25,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:13:25,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:27,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:27,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:13:27,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:13:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:13:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:13:27,231 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 11:13:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,407 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:13:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:13:27,407 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 11:13:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,408 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:13:27,408 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:13:27,409 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 11:13:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:13:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 11:13:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:13:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:13:27,411 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 11:13:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,412 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:13:27,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:13:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:13:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:13:27,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,413 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 11:13:27,413 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -487252894, now seen corresponding path program 62 times [2019-08-05 11:13:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:28,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:13:28,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:13:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:13:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:28,890 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 11:13:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,087 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 11:13:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:13:29,088 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 11:13:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,089 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:13:29,089 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:13:29,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:13:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 11:13:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:13:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:13:29,092 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 11:13:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:29,092 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:13:29,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:13:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:13:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:13:29,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:29,093 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 11:13:29,093 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -98978642, now seen corresponding path program 63 times [2019-08-05 11:13:29,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:29,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:13:29,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:30,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:30,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:13:30,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:13:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:13:30,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:30,659 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 11:13:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:30,835 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:13:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:13:30,835 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 11:13:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:30,836 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:13:30,836 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:13:30,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:13:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 11:13:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:13:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:13:30,840 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 11:13:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,840 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:13:30,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:13:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:13:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:13:30,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,841 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 11:13:30,841 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash -629577222, now seen corresponding path program 64 times [2019-08-05 11:13:30,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:32,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:13:32,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:13:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:13:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:13:32,834 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 11:13:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:33,031 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:13:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:13:33,031 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 11:13:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:33,032 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:13:33,032 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:13:33,033 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 11:13:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:13:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 11:13:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:13:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:13:33,036 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 11:13:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:33,036 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:13:33,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:13:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:13:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:13:33,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:33,037 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 11:13:33,037 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 566295622, now seen corresponding path program 65 times [2019-08-05 11:13:33,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:13:33,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:13:36,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:13:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:13:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:36,737 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 11:13:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:36,953 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 11:13:36,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:13:36,953 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 11:13:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:36,954 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:13:36,954 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:13:36,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:13:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:13:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:13:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:13:36,958 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 11:13:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:36,958 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:13:36,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:13:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:13:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:13:36,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:36,959 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 11:13:36,959 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1251136622, now seen corresponding path program 66 times [2019-08-05 11:13:36,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:36,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:13:36,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:38,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:13:38,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:13:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:13:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:38,655 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 11:13:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:38,935 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:13:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:13:38,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 11:13:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:38,937 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:13:38,937 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:13:38,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:13:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 11:13:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:13:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:13:38,940 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 11:13:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:38,941 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:13:38,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:13:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:13:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:13:38,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:38,942 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 11:13:38,942 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash 248166366, now seen corresponding path program 67 times [2019-08-05 11:13:38,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:38,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:13:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:40,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:13:40,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:13:40,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:13:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:40,936 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 11:13:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:42,059 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:13:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:13:42,060 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 11:13:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:42,061 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:13:42,061 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:13:42,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:13:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 11:13:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:13:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:13:42,065 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 11:13:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:42,065 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:13:42,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:13:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:13:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:13:42,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:42,066 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 11:13:42,066 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2030673622, now seen corresponding path program 68 times [2019-08-05 11:13:42,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:42,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:13:42,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:43,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:43,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:13:43,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:13:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:13:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:43,846 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 11:13:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:44,119 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 11:13:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:13:44,120 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 11:13:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:44,121 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:13:44,121 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:13:44,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:13:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 11:13:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:13:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:13:44,124 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 11:13:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:44,124 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:13:44,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:13:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:13:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:13:44,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:44,125 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 11:13:44,125 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1562581130, now seen corresponding path program 69 times [2019-08-05 11:13:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:44,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:13:44,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:13:45,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:13:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:13:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:45,867 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 11:13:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:46,080 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 11:13:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:13:46,081 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 11:13:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:46,082 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:13:46,082 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:13:46,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:13:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 11:13:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:13:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 11:13:46,086 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 11:13:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:46,086 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 11:13:46,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:13:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 11:13:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:13:46,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:46,087 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 11:13:46,087 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1597704898, now seen corresponding path program 70 times [2019-08-05 11:13:46,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:46,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:13:46,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:48,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:48,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:13:48,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:13:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:13:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:48,356 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 11:13:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:48,575 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:13:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:13:48,575 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 11:13:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:48,577 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:13:48,577 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:13:48,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:13:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 11:13:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:13:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 11:13:48,580 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 11:13:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:48,581 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 11:13:48,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:13:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 11:13:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:13:48,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:48,582 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 11:13:48,582 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2090699534, now seen corresponding path program 71 times [2019-08-05 11:13:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:48,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:13:48,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:50,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:13:50,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:13:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:13:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:50,525 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 11:13:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:50,787 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 11:13:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:13:50,788 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 11:13:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:50,789 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:13:50,789 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:13:50,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:13:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 11:13:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:13:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:13:50,793 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 11:13:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:50,793 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:13:50,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:13:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:13:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:13:50,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:50,794 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 11:13:50,794 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash -882825126, now seen corresponding path program 72 times [2019-08-05 11:13:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:50,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:13:50,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:53,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:13:53,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:13:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:13:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:53,185 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 11:13:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,430 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 11:13:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:13:53,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 11:13:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,432 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:13:53,432 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:13:53,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:13:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 11:13:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:13:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 11:13:53,435 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 11:13:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,435 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 11:13:53,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:13:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 11:13:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:13:53,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,437 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 11:13:53,437 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2008195750, now seen corresponding path program 73 times [2019-08-05 11:13:53,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:13:55,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:13:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:13:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:55,576 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 11:13:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:55,855 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:13:55,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:13:55,856 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 11:13:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:55,857 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:55,857 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:55,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 11:13:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:13:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 11:13:55,860 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 11:13:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:55,860 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 11:13:55,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:13:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 11:13:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:13:55,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:55,861 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 11:13:55,861 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1435417074, now seen corresponding path program 74 times [2019-08-05 11:13:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:55,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:13:55,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:13:59,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:13:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:13:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:13:59,058 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 11:13:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,301 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 11:13:59,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:13:59,301 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 11:13:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,303 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:13:59,303 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:13:59,303 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 11:13:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:13:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 11:13:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:13:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:13:59,306 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 11:13:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,306 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:13:59,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:13:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:13:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:13:59,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,307 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 11:13:59,307 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash 750923326, now seen corresponding path program 75 times [2019-08-05 11:13:59,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:14:01,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:14:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:14:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:14:01,899 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 11:14:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,203 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 11:14:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:14:02,203 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 11:14:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,204 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:14:02,204 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:14:02,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:14:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:14:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 11:14:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:14:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 11:14:02,208 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 11:14:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,208 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 11:14:02,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:14:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 11:14:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:14:02,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,209 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 11:14:02,209 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash 82427786, now seen corresponding path program 76 times [2019-08-05 11:14:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:14:04,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:14:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:14:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:14:04,337 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 11:14:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,570 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:14:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:14:04,570 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 11:14:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,572 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:14:04,572 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:14:04,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:14:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:14:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 11:14:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:14:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 11:14:04,576 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 11:14:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,576 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 11:14:04,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:14:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 11:14:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:14:04,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,577 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 11:14:04,577 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1903308246, now seen corresponding path program 77 times [2019-08-05 11:14:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:06,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:14:06,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:14:06,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:14:06,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:06,903 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 11:14:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,167 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 11:14:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:14:07,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 11:14:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,169 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:14:07,169 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:14:07,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:14:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:14:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:14:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:14:07,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 11:14:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,171 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:14:07,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:14:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:14:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:14:07,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,172 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1] [2019-08-05 11:14:07,173 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash -577226462, now seen corresponding path program 78 times [2019-08-05 11:14:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:09,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:14:09,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:14:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:14:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:09,668 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 11:14:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,918 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 11:14:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:14:09,918 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 11:14:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,919 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:14:09,919 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:14:09,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:14:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 11:14:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:14:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 11:14:09,923 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 11:14:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,924 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 11:14:09,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:14:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 11:14:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:14:09,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,925 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1] [2019-08-05 11:14:09,925 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -664231570, now seen corresponding path program 79 times [2019-08-05 11:14:09,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:12,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:14:12,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:14:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:14:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:12,127 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 11:14:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,429 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:14:12,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:14:12,429 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 11:14:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,430 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:14:12,430 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:14:12,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:14:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-08-05 11:14:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:14:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 11:14:12,433 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 11:14:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,433 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 11:14:12,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:14:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 11:14:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:14:12,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,434 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1] [2019-08-05 11:14:12,434 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1623205562, now seen corresponding path program 80 times [2019-08-05 11:14:12,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:14,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:14:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:14:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:14:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:14,980 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 11:14:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,226 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 11:14:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:14:15,226 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 11:14:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,227 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:14:15,227 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:14:15,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:14:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 11:14:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:14:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:14:15,230 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 11:14:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,231 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:14:15,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:14:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:14:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:14:15,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,232 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1] [2019-08-05 11:14:15,232 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash 827033862, now seen corresponding path program 81 times [2019-08-05 11:14:15,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:17,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:14:17,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:14:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:14:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:17,916 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 11:14:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:18,166 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 11:14:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:14:18,166 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 11:14:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:18,167 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:14:18,167 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:14:18,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:14:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-08-05 11:14:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:14:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 11:14:18,171 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 11:14:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:18,171 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 11:14:18,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:14:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 11:14:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:14:18,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:18,172 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1] [2019-08-05 11:14:18,172 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 210208850, now seen corresponding path program 82 times [2019-08-05 11:14:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:18,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:14:18,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:20,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:14:20,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:14:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:14:20,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:20,551 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 11:14:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,795 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:14:20,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:14:20,796 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 11:14:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,797 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:14:20,797 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:14:20,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:14:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 11:14:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:14:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 11:14:20,801 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 11:14:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,801 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 11:14:20,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:14:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 11:14:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:14:20,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,802 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1] [2019-08-05 11:14:20,802 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 146859166, now seen corresponding path program 83 times [2019-08-05 11:14:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:14:23,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:14:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:14:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:23,774 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 11:14:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:24,043 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 11:14:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:14:24,043 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 11:14:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:24,045 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:14:24,045 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:14:24,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:14:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-08-05 11:14:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:14:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:14:24,048 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 11:14:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:24,049 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:14:24,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:14:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:14:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:14:24,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:24,050 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1] [2019-08-05 11:14:24,050 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -602645014, now seen corresponding path program 84 times [2019-08-05 11:14:24,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:24,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:14:24,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:26,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:14:26,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:14:26,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:14:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:26,852 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 11:14:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:27,123 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 11:14:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:14:27,124 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 11:14:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:27,125 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:14:27,125 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:14:27,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:14:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-08-05 11:14:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:14:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 11:14:27,129 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 11:14:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:27,129 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 11:14:27,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:14:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 11:14:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:14:27,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:27,130 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1] [2019-08-05 11:14:27,130 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 678343734, now seen corresponding path program 85 times [2019-08-05 11:14:27,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:27,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:14:27,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:30,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:30,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:14:30,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:14:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:14:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:30,086 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 11:14:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:30,381 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:14:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:14:30,381 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 11:14:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:30,383 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:14:30,383 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:14:30,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:14:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-08-05 11:14:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:14:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 11:14:30,387 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 11:14:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:30,387 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 11:14:30,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:14:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 11:14:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:14:30,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:30,388 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1] [2019-08-05 11:14:30,389 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash -947083390, now seen corresponding path program 86 times [2019-08-05 11:14:30,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:30,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:14:30,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:14:33,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:14:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:14:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:33,492 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 11:14:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:33,759 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 11:14:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:14:33,759 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 11:14:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:33,761 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:14:33,761 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:14:33,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:14:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-08-05 11:14:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:14:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:14:33,764 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 11:14:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:33,765 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:14:33,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:14:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:14:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:14:33,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:33,766 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1] [2019-08-05 11:14:33,766 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 385546190, now seen corresponding path program 87 times [2019-08-05 11:14:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:33,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:14:33,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:36,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:36,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:14:36,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:14:36,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:14:36,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:36,471 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 11:14:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,738 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 11:14:36,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:14:36,738 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 11:14:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,740 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:14:36,740 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:14:36,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:14:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 11:14:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:14:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 11:14:36,744 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 11:14:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,744 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 11:14:36,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:14:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 11:14:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:14:36,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,745 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1] [2019-08-05 11:14:36,745 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1142318362, now seen corresponding path program 88 times [2019-08-05 11:14:36,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:14:39,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:14:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:14:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:39,824 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 11:14:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:40,101 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:14:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:14:40,102 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 11:14:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:40,103 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:14:40,103 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:14:40,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:14:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-08-05 11:14:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:14:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 11:14:40,106 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 11:14:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:40,106 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 11:14:40,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:14:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 11:14:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:14:40,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:40,107 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1] [2019-08-05 11:14:40,107 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1744064666, now seen corresponding path program 89 times [2019-08-05 11:14:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:40,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:14:40,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:14:43,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:14:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:14:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:43,363 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 11:14:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,646 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 11:14:43,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:14:43,647 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 11:14:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,648 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:14:43,648 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:14:43,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:14:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-08-05 11:14:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:14:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:14:43,652 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 11:14:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,652 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:14:43,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:14:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:14:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:14:43,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,653 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1] [2019-08-05 11:14:43,653 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1009281358, now seen corresponding path program 90 times [2019-08-05 11:14:43,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:46,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:46,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:14:46,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:14:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:14:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:46,607 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 11:14:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:46,890 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-05 11:14:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:14:46,891 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 11:14:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:46,892 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:14:46,892 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:14:46,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:14:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:14:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:14:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 11:14:46,896 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 11:14:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 11:14:46,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:14:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 11:14:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:14:46,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:46,897 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1] [2019-08-05 11:14:46,898 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash 742841086, now seen corresponding path program 91 times [2019-08-05 11:14:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:46,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:14:46,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:50,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:14:50,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:14:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:14:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:50,118 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 11:14:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:50,404 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:14:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:14:50,405 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 11:14:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:50,406 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:50,406 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:50,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-08-05 11:14:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:14:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 11:14:50,410 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 11:14:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:50,410 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 11:14:50,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:14:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 11:14:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:14:50,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:50,411 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1] [2019-08-05 11:14:50,411 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 905329738, now seen corresponding path program 92 times [2019-08-05 11:14:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:50,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:14:50,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:14:54,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:14:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:14:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:54,299 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 11:14:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:54,577 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 11:14:54,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:14:54,577 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 11:14:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:54,578 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:14:54,578 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:14:54,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:14:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-08-05 11:14:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:14:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:14:54,582 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 11:14:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:54,583 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:14:54,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:14:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:14:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:14:54,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:54,584 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1] [2019-08-05 11:14:54,584 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1856865642, now seen corresponding path program 93 times [2019-08-05 11:14:54,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:54,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:14:54,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:14:57,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:14:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:14:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:57,811 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 11:14:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,102 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-05 11:14:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:14:58,102 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 11:14:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,103 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:14:58,103 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:14:58,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:14:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-08-05 11:14:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:14:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 11:14:58,106 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 11:14:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,106 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 11:14:58,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:14:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 11:14:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:14:58,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,107 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1] [2019-08-05 11:14:58,107 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2036836894, now seen corresponding path program 94 times [2019-08-05 11:14:58,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:01,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:15:01,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:15:01,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:15:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:15:01,527 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 11:15:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:01,839 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:15:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:15:01,839 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 11:15:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:01,841 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:15:01,841 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:15:01,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:15:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:15:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-08-05 11:15:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:15:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 11:15:01,844 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 11:15:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:01,844 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 11:15:01,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:15:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 11:15:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:15:01,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:01,845 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1] [2019-08-05 11:15:01,845 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1104449070, now seen corresponding path program 95 times [2019-08-05 11:15:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:01,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:15:01,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:15:05,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:15:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:15:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:15:05,388 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 11:15:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,683 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 11:15:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:15:05,684 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 11:15:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,685 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:15:05,685 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:15:05,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:15:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:15:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-08-05 11:15:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:15:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:15:05,689 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 11:15:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,689 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:15:05,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:15:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:15:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:15:05,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,691 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1] [2019-08-05 11:15:05,691 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash 518251386, now seen corresponding path program 96 times [2019-08-05 11:15:05,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:15:09,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:15:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:15:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:09,244 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 11:15:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,546 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-05 11:15:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:15:09,547 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 11:15:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,548 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:15:09,548 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:15:09,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:15:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-08-05 11:15:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:15:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 11:15:09,552 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 11:15:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,552 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 11:15:09,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:15:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 11:15:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:15:09,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,554 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1] [2019-08-05 11:15:09,554 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash -177007162, now seen corresponding path program 97 times [2019-08-05 11:15:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:15:12,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:15:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:15:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:12,877 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 11:15:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:13,190 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:15:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:15:13,191 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 11:15:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:13,192 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:15:13,193 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:15:13,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:15:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-08-05 11:15:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:15:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 11:15:13,196 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 11:15:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:13,196 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 11:15:13,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:15:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 11:15:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:15:13,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:13,198 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1] [2019-08-05 11:15:13,198 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1694426386, now seen corresponding path program 98 times [2019-08-05 11:15:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:13,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:15:13,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:16,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:16,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:15:16,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:15:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:15:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:16,921 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 11:15:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:17,254 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:15:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:15:17,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 11:15:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:17,256 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:15:17,256 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:15:17,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:15:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-08-05 11:15:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:15:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:15:17,260 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 11:15:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:17,260 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:15:17,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:15:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:15:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:15:17,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:17,262 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1] [2019-08-05 11:15:17,262 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 550768990, now seen corresponding path program 99 times [2019-08-05 11:15:17,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:17,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:15:17,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:15:20,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:15:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:15:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:20,965 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 11:15:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:21,283 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-05 11:15:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:15:21,284 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 11:15:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:21,284 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:15:21,285 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:15:21,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:15:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-08-05 11:15:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:15:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 11:15:21,288 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 11:15:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:21,288 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 11:15:21,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:15:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 11:15:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:15:21,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:21,289 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1] [2019-08-05 11:15:21,289 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1007639210, now seen corresponding path program 100 times [2019-08-05 11:15:21,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:21,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:15:21,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:25,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:15:25,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:15:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:15:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:25,106 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 11:15:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,419 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:15:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:15:25,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 11:15:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,420 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:15:25,420 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:15:25,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:15:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-08-05 11:15:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:15:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 11:15:25,424 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 11:15:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,424 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 11:15:25,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:15:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 11:15:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:15:25,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,425 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1] [2019-08-05 11:15:25,425 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1973256438, now seen corresponding path program 101 times [2019-08-05 11:15:25,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:29,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:29,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:15:29,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:15:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:15:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:29,459 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2019-08-05 11:15:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:29,829 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 11:15:29,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:15:29,830 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2019-08-05 11:15:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:29,830 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:15:29,830 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:15:29,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:15:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-08-05 11:15:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:15:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:15:29,833 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 11:15:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:29,834 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:15:29,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:15:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:15:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:15:29,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:29,835 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1] [2019-08-05 11:15:29,835 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2076490686, now seen corresponding path program 102 times [2019-08-05 11:15:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:29,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:15:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:33,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:15:33,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:15:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:15:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:33,565 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2019-08-05 11:15:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,931 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-08-05 11:15:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:15:33,931 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2019-08-05 11:15:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,932 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:15:33,932 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:15:33,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:15:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-08-05 11:15:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 11:15:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 11:15:33,938 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 11:15:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,938 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 11:15:33,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:15:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 11:15:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:15:33,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,941 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1] [2019-08-05 11:15:33,941 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1651860622, now seen corresponding path program 103 times [2019-08-05 11:15:33,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:37,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:37,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:15:37,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:15:37,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:15:37,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:37,982 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2019-08-05 11:15:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:38,349 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:15:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:15:38,349 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2019-08-05 11:15:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:38,350 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:15:38,350 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:15:38,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:15:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-08-05 11:15:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:15:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 11:15:38,352 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 11:15:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:38,353 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 11:15:38,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:15:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 11:15:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:15:38,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:38,355 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1] [2019-08-05 11:15:38,355 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1700224550, now seen corresponding path program 104 times [2019-08-05 11:15:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:38,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:15:38,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:42,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:15:42,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:15:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:15:42,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:42,435 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2019-08-05 11:15:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:42,784 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 11:15:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:15:42,784 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2019-08-05 11:15:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:42,785 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:15:42,785 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:15:42,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:15:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:15:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:15:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:15:42,788 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 11:15:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:42,788 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:15:42,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:15:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:15:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:15:42,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:42,789 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1] [2019-08-05 11:15:42,789 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:42,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1828602842, now seen corresponding path program 105 times [2019-08-05 11:15:42,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:42,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:15:42,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:46,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:15:46,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:15:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:15:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:46,910 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2019-08-05 11:15:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:47,251 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-08-05 11:15:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:15:47,251 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2019-08-05 11:15:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:47,252 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:15:47,252 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:15:47,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:15:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-08-05 11:15:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:15:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 11:15:47,255 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 11:15:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:47,256 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 11:15:47,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:15:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 11:15:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:15:47,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:47,257 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1] [2019-08-05 11:15:47,257 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -646089870, now seen corresponding path program 106 times [2019-08-05 11:15:47,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:47,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:15:47,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:51,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:51,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:15:51,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:15:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:15:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:51,496 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2019-08-05 11:15:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:51,877 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:15:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:15:51,877 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2019-08-05 11:15:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:51,878 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:15:51,878 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:15:51,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:15:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-08-05 11:15:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 11:15:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 11:15:51,881 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 11:15:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:51,882 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 11:15:51,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:15:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 11:15:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:15:51,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,883 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1] [2019-08-05 11:15:51,883 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1877510078, now seen corresponding path program 107 times [2019-08-05 11:15:51,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:15:56,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:15:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:15:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:56,148 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. [2019-08-05 11:15:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:56,493 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-05 11:15:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:15:56,494 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2019-08-05 11:15:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:56,494 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:15:56,495 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:15:56,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:15:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-08-05 11:15:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:15:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 11:15:56,497 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2019-08-05 11:15:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:56,498 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 11:15:56,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:15:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 11:15:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:15:56,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:56,498 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1] [2019-08-05 11:15:56,499 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash 400537866, now seen corresponding path program 108 times [2019-08-05 11:15:56,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:56,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:15:56,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:00,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:00,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:16:00,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:16:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:16:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:16:00,841 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 111 states. [2019-08-05 11:16:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:01,198 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-08-05 11:16:01,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:16:01,199 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 219 [2019-08-05 11:16:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:01,200 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:16:01,200 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:16:01,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:16:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:16:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-08-05 11:16:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-08-05 11:16:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-08-05 11:16:01,203 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2019-08-05 11:16:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:01,203 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-08-05 11:16:01,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:16:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-08-05 11:16:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:16:01,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:01,204 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1] [2019-08-05 11:16:01,205 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1630550186, now seen corresponding path program 109 times [2019-08-05 11:16:01,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:01,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:16:01,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:05,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:16:05,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:16:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:16:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:16:05,655 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 112 states. [2019-08-05 11:16:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:06,059 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-08-05 11:16:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:16:06,059 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 221 [2019-08-05 11:16:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:06,060 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:16:06,060 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:16:06,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:16:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:16:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-08-05 11:16:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:16:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-05 11:16:06,064 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2019-08-05 11:16:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:06,064 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-05 11:16:06,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:16:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-05 11:16:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:16:06,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:06,065 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1] [2019-08-05 11:16:06,065 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash 703951522, now seen corresponding path program 110 times [2019-08-05 11:16:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:06,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:16:06,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:10,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:10,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:16:10,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:16:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:16:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:10,568 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 113 states. [2019-08-05 11:16:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:10,940 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-05 11:16:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:16:10,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 223 [2019-08-05 11:16:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:10,941 INFO L225 Difference]: With dead ends: 227 [2019-08-05 11:16:10,941 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 11:16:10,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 11:16:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-08-05 11:16:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 11:16:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-08-05 11:16:10,944 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2019-08-05 11:16:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:10,944 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-08-05 11:16:10,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:16:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-08-05 11:16:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:16:10,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:10,946 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1] [2019-08-05 11:16:10,946 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2107802898, now seen corresponding path program 111 times [2019-08-05 11:16:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:10,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:16:10,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:15,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:15,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:16:15,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:16:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:16:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:15,485 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 114 states. [2019-08-05 11:16:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:15,845 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-08-05 11:16:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:16:15,845 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 225 [2019-08-05 11:16:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:15,846 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:16:15,846 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:16:15,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:16:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2019-08-05 11:16:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 11:16:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2019-08-05 11:16:15,850 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2019-08-05 11:16:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:15,850 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2019-08-05 11:16:15,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:16:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2019-08-05 11:16:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:16:15,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:15,851 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1] [2019-08-05 11:16:15,852 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1625595962, now seen corresponding path program 112 times [2019-08-05 11:16:15,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:16:15,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:20,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:16:20,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:16:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:16:20,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:20,214 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 115 states. [2019-08-05 11:16:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:20,689 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-08-05 11:16:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:16:20,690 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 227 [2019-08-05 11:16:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:20,691 INFO L225 Difference]: With dead ends: 231 [2019-08-05 11:16:20,691 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 11:16:20,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 11:16:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-08-05 11:16:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 11:16:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-08-05 11:16:20,694 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2019-08-05 11:16:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:20,695 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-08-05 11:16:20,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:16:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-08-05 11:16:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-05 11:16:20,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:20,695 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1] [2019-08-05 11:16:20,696 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1170759034, now seen corresponding path program 113 times [2019-08-05 11:16:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:20,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:16:20,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:25,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:16:25,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:16:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:16:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:25,115 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 116 states. [2019-08-05 11:16:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:25,579 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-08-05 11:16:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:16:25,579 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 229 [2019-08-05 11:16:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:25,579 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:16:25,580 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:16:25,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:16:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-08-05 11:16:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 11:16:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-08-05 11:16:25,582 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2019-08-05 11:16:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:25,582 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-08-05 11:16:25,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:16:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-08-05 11:16:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 11:16:25,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:25,583 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1] [2019-08-05 11:16:25,583 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 181617106, now seen corresponding path program 114 times [2019-08-05 11:16:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:25,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:16:25,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:16:27,938 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:16:27,938 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:16:27,942 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:16:27,942 INFO L202 PluginConnector]: Adding new model loop-nested-assume-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:27 BoogieIcfgContainer [2019-08-05 11:16:27,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:27,945 INFO L168 Benchmark]: Toolchain (without parser) took 238078.05 ms. Allocated memory was 133.2 MB in the beginning and 651.2 MB in the end (delta: 518.0 MB). Free memory was 109.5 MB in the beginning and 520.9 MB in the end (delta: -411.3 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:27,945 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.33 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:16:27,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.69 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:27,946 INFO L168 Benchmark]: Boogie Preprocessor took 23.08 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:27,947 INFO L168 Benchmark]: RCFGBuilder took 394.95 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 96.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:27,947 INFO L168 Benchmark]: TraceAbstraction took 237607.13 ms. Allocated memory was 133.2 MB in the beginning and 651.2 MB in the end (delta: 518.0 MB). Free memory was 96.1 MB in the beginning and 520.9 MB in the end (delta: -424.8 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:27,949 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 1.33 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.69 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.08 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.95 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 96.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237607.13 ms. Allocated memory was 133.2 MB in the beginning and 651.2 MB in the end (delta: 518.0 MB). Free memory was 96.1 MB in the beginning and 520.9 MB in the end (delta: -424.8 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 232 with TraceHistMax 114,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 81 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 232 with TraceHistMax 114,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 81 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 237.5s OverallTime, 118 OverallIterations, 114 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 6569 SDslu, 1068 SDs, 0 SdLazy, 14415 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13128 GetRequests, 6560 SyntacticMatches, 0 SemanticMatches, 6568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 202.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=117, 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, 117 MinimizatonAttempts, 117 StatesRemovedByMinimization, 114 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 206.2s InterpolantComputationTime, 13239 NumberOfCodeBlocks, 13239 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 13122 ConstructedInterpolants, 0 QuantifiedInterpolants, 5978352 SizeOfPredicates, 118 NumberOfNonLiveVariables, 33039 ConjunctsInSsa, 6682 ConjunctsInUnsatCore, 117 InterpolantComputations, 2 PerfectInterpolantSequences, 5/487377 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown