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/unclassified/Fibonaccinacci.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:18,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:18,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:18,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:18,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:18,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:18,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:18,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:18,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:18,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:18,598 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:18,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:18,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:18,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:18,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:18,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:18,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:18,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:18,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:18,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:18,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:18,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:18,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:18,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:18,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:18,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:18,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:18,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:18,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:18,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:18,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:18,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:18,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:18,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:18,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:18,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:18,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:18,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:18,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:18,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:18,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:18,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:18,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:18,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:18,694 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:18,694 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:18,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci.bpl [2019-08-05 11:14:18,695 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci.bpl' [2019-08-05 11:14:18,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:18,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:18,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:18,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:18,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:18,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,756 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:18,756 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:18,757 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:18,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:18,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:18,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:18,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:18,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/1) ... [2019-08-05 11:14:18,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:18,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:18,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:18,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:18,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (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:14:18,855 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:19,070 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:19,070 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:19,071 INFO L202 PluginConnector]: Adding new model Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:19 BoogieIcfgContainer [2019-08-05 11:14:19,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:19,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:19,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:19,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:19,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:18" (1/2) ... [2019-08-05 11:14:19,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f03d60 and model type Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:19, skipping insertion in model container [2019-08-05 11:14:19,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:19" (2/2) ... [2019-08-05 11:14:19,080 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonaccinacci.bpl [2019-08-05 11:14:19,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:19,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:19,108 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:19,131 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:19,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:19,132 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:19,132 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:19,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:19,133 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:19,133 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:19,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:19,133 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:14:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:14:19,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:14:19,158 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:14:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,286 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:14:19,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:19,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:19,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:19,310 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:14:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,384 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:19,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:19,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:14:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,400 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:19,401 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:14:19,403 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:14:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:14:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:14:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:14:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:14:19,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:14:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,435 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:14:19,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:14:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:19,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:19,437 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:14:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:19,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:19,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:19,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:19,624 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:14:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,696 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:19,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,697 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:19,697 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:14:19,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:14:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:14:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:14:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:14:19,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:14:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,701 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:14:19,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:14:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:19,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:14:19,702 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:14:19,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:14:19,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:19,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:19,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:19,770 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:14:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,849 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:14:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:19,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:14:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,851 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:19,851 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:19,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:14:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:14:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 11:14:19,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 11:14:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,855 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 11:14:19,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 11:14:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:19,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,856 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:14:19,857 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1980957838, now seen corresponding path program 2 times [2019-08-05 11:14:19,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:19,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:19,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:19,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:19,904 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-05 11:14:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:19,949 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 11:14:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:19,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:14:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:19,951 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:19,951 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:19,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:14:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:14:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 11:14:19,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-08-05 11:14:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:19,956 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 11:14:19,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 11:14:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:19,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:19,957 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:14:19,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1280089312, now seen corresponding path program 3 times [2019-08-05 11:14:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:19,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:19,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:20,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:20,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:20,120 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-08-05 11:14:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,240 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:14:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:20,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:14:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,242 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:20,242 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:14:20,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:14:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:14:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:14:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:14:20,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-08-05 11:14:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,245 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:14:20,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:14:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:20,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,246 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-08-05 11:14:20,246 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -578925054, now seen corresponding path program 4 times [2019-08-05 11:14:20,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:20,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:20,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:20,433 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 11:14:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,487 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:14:20,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:20,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,488 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:14:20,489 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:20,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:14:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:14:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:14:20,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-08-05 11:14:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,492 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:14:20,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:14:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:20,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,493 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 11:14:20,493 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1921171744, now seen corresponding path program 5 times [2019-08-05 11:14:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:20,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:20,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:20,688 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-08-05 11:14:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,744 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 11:14:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:20,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:14:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,746 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:20,746 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:20,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:14:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:14:20,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-08-05 11:14:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,750 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:14:20,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:14:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:20,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,751 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 11:14:20,751 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2114761154, now seen corresponding path program 6 times [2019-08-05 11:14:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:20,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:20,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:20,927 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-08-05 11:14:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,977 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 11:14:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:20,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:14:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,979 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:20,979 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:20,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:14:20,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2019-08-05 11:14:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,983 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:14:20,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:14:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:20,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,984 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 11:14:20,984 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash -473901728, now seen corresponding path program 7 times [2019-08-05 11:14:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:14:21,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:21,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:21,104 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2019-08-05 11:14:21,265 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 11:14:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,438 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:14:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:21,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 11:14:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,440 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:21,440 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:14:21,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:14:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-08-05 11:14:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:14:21,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-08-05 11:14:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,446 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:14:21,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:14:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:21,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,447 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1] [2019-08-05 11:14:21,447 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1806113202, now seen corresponding path program 8 times [2019-08-05 11:14:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:14:21,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:21,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:21,562 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-08-05 11:14:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,667 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-08-05 11:14:21,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:21,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 11:14:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,669 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:14:21,669 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:14:21,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:14:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-08-05 11:14:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:14:21,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2019-08-05 11:14:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,673 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:14:21,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:14:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:21,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,674 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 11:14:21,674 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -154995936, now seen corresponding path program 9 times [2019-08-05 11:14:21,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:14:21,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:21,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:21,878 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-05 11:14:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,977 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-08-05 11:14:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:21,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 11:14:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,979 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:21,979 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:21,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:14:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:14:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:14:21,983 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-08-05 11:14:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,990 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:14:21,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:14:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:14:21,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,992 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 1, 1, 1] [2019-08-05 11:14:21,992 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash -509968242, now seen corresponding path program 10 times [2019-08-05 11:14:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:22,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:22,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 11:14:22,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:22,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:22,095 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-08-05 11:14:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:22,139 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 11:14:22,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:22,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-08-05 11:14:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:22,140 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:14:22,140 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:14:22,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:14:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:14:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:14:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 11:14:22,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2019-08-05 11:14:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:22,144 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 11:14:22,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 11:14:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:22,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:22,145 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 3, 1, 1, 1] [2019-08-05 11:14:22,146 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1172098598, now seen corresponding path program 11 times [2019-08-05 11:14:22,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:22,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:22,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 11:14:22,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:22,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:22,383 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 7 states. [2019-08-05 11:14:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:22,581 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-08-05 11:14:22,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:22,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:14:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:22,584 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:14:22,585 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:14:22,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:14:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:14:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:14:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:14:22,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-08-05 11:14:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:22,588 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:14:22,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:14:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:14:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:22,588 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 3, 1, 1, 1] [2019-08-05 11:14:22,589 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1975379692, now seen corresponding path program 12 times [2019-08-05 11:14:22,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:22,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:22,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 11:14:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:22,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:22,801 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2019-08-05 11:14:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,016 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-08-05 11:14:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:23,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-08-05 11:14:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,017 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:14:23,017 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:14:23,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:14:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:14:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:14:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-08-05 11:14:23,021 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2019-08-05 11:14:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,021 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-08-05 11:14:23,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-08-05 11:14:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:14:23,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,022 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 3, 1, 1, 1] [2019-08-05 11:14:23,022 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1107289830, now seen corresponding path program 13 times [2019-08-05 11:14:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:14:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:23,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:23,115 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-08-05 11:14:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,174 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-08-05 11:14:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:23,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-08-05 11:14:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,176 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:23,176 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:23,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:14:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:14:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-08-05 11:14:23,180 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2019-08-05 11:14:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,180 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-08-05 11:14:23,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-08-05 11:14:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:14:23,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,181 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 4, 1, 1, 1] [2019-08-05 11:14:23,181 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1930019378, now seen corresponding path program 14 times [2019-08-05 11:14:23,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 111 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:14:23,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:23,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:23,520 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-08-05 11:14:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,637 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-08-05 11:14:23,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:23,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 11:14:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,639 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:14:23,639 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:14:23,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:14:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:14:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:14:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-08-05 11:14:23,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2019-08-05 11:14:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,645 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-08-05 11:14:23,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-08-05 11:14:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:14:23,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,646 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 4, 1, 1, 1] [2019-08-05 11:14:23,647 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash 298879904, now seen corresponding path program 15 times [2019-08-05 11:14:23,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:14:23,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:23,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:23,772 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-08-05 11:14:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,812 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-08-05 11:14:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:23,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-08-05 11:14:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,813 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:14:23,813 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:14:23,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:14:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:14:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:14:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:14:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-08-05 11:14:23,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 25 [2019-08-05 11:14:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,819 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-08-05 11:14:23,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-08-05 11:14:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:14:23,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,820 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 5, 1, 1, 1] [2019-08-05 11:14:23,820 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash 456488328, now seen corresponding path program 16 times [2019-08-05 11:14:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 202 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:14:29,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:14:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:14:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=535, Unknown=6, NotChecked=0, Total=600 [2019-08-05 11:14:29,652 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 25 states. [2019-08-05 11:14:30,566 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 11:14:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,014 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-08-05 11:14:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:14:34,015 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-08-05 11:14:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,018 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:14:34,018 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:14:34,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=75, Invalid=675, Unknown=6, NotChecked=0, Total=756 [2019-08-05 11:14:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:14:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-08-05 11:14:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:14:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-08-05 11:14:34,024 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 28 [2019-08-05 11:14:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,024 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-08-05 11:14:34,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:14:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-08-05 11:14:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:34,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,026 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 5, 1, 1, 1] [2019-08-05 11:14:34,026 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1692754650, now seen corresponding path program 17 times [2019-08-05 11:14:34,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-08-05 11:14:34,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:34,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:14:34,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,152 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 9 states. [2019-08-05 11:14:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,201 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2019-08-05 11:14:34,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:34,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:14:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,203 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:14:34,203 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:14:34,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:14:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-08-05 11:14:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:14:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-08-05 11:14:34,208 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 29 [2019-08-05 11:14:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,209 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-08-05 11:14:34,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-08-05 11:14:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:34,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,210 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 5, 1, 1, 1] [2019-08-05 11:14:34,210 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -82335014, now seen corresponding path program 18 times [2019-08-05 11:14:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:14:34,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:34,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:14:34,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:34,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,363 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 9 states. [2019-08-05 11:14:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,447 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-08-05 11:14:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:34,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:14:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,448 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:14:34,448 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:14:34,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:14:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-08-05 11:14:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:14:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-08-05 11:14:34,457 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 29 [2019-08-05 11:14:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,457 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-08-05 11:14:34,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-08-05 11:14:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:34,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,458 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 5, 1, 1, 1] [2019-08-05 11:14:34,458 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 713953166, now seen corresponding path program 19 times [2019-08-05 11:14:34,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:14:34,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:34,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:14:34,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,574 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 9 states. [2019-08-05 11:14:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:34,617 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-08-05 11:14:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:34,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:14:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:34,619 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:14:34,619 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:14:34,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:14:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-08-05 11:14:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:14:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-08-05 11:14:34,623 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2019-08-05 11:14:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:34,623 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-08-05 11:14:34,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-08-05 11:14:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:34,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:34,624 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 5, 1, 1, 1] [2019-08-05 11:14:34,625 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash -340751782, now seen corresponding path program 20 times [2019-08-05 11:14:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:34,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:34,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:14:34,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:34,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:14:34,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:34,896 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 9 states. [2019-08-05 11:14:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,032 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-08-05 11:14:35,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:35,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:14:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,035 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:14:35,035 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:14:35,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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:14:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:14:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-08-05 11:14:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:14:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-08-05 11:14:35,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2019-08-05 11:14:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,039 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-08-05 11:14:35,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-08-05 11:14:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:35,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,040 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 5, 1, 1, 1] [2019-08-05 11:14:35,040 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1266174758, now seen corresponding path program 21 times [2019-08-05 11:14:35,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 105 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 11:14:35,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:35,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:35,134 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2019-08-05 11:14:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,214 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:14:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:35,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 11:14:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,215 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:14:35,215 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:14:35,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:14:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:14:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:14:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:14:35,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:14:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,219 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:14:35,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:14:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:14:35,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,220 INFO L399 BasicCegarLoop]: trace histogram [16, 6, 6, 1, 1, 1] [2019-08-05 11:14:35,221 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1369793184, now seen corresponding path program 22 times [2019-08-05 11:14:35,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-08-05 11:14:35,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:35,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:35,343 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 7 states. [2019-08-05 11:14:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,399 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-08-05 11:14:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:35,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 11:14:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,400 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:35,400 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:14:35,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:14:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:14:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:14:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:14:35,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-08-05 11:14:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,402 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:14:35,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:14:35,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:14:35,407 INFO L202 PluginConnector]: Adding new model Fibonaccinacci.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:35 BoogieIcfgContainer [2019-08-05 11:14:35,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:35,409 INFO L168 Benchmark]: Toolchain (without parser) took 16685.63 ms. Allocated memory was 141.6 MB in the beginning and 271.1 MB in the end (delta: 129.5 MB). Free memory was 111.2 MB in the beginning and 219.7 MB in the end (delta: -108.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,410 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.15 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 109.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,411 INFO L168 Benchmark]: Boogie Preprocessor took 23.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.3 MB in the beginning and 108.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,412 INFO L168 Benchmark]: RCFGBuilder took 288.21 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 98.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,413 INFO L168 Benchmark]: TraceAbstraction took 16333.25 ms. Allocated memory was 141.6 MB in the beginning and 271.1 MB in the end (delta: 129.5 MB). Free memory was 98.5 MB in the beginning and 219.7 MB in the end (delta: -121.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:35,417 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.5 MB in the beginning and 112.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.15 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 109.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.60 ms. Allocated memory is still 141.6 MB. Free memory was 109.3 MB in the beginning and 108.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 288.21 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 98.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16333.25 ms. Allocated memory was 141.6 MB in the beginning and 271.1 MB in the end (delta: 129.5 MB). Free memory was 98.5 MB in the beginning and 219.7 MB in the end (delta: -121.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 24 OverallIterations, 16 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 117 SDslu, 88 SDs, 0 SdLazy, 970 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=19, 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.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 61 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 411 ConstructedInterpolants, 23 QuantifiedInterpolants, 54240 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1763 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 1645/2432 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...