java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:36:21,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:36:21,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:36:21,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:36:21,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:36:21,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:36:21,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:36:21,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:36:21,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:36:21,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:36:21,405 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:36:21,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:36:21,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:36:21,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:36:21,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:36:21,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:36:21,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:36:21,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:36:21,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:36:21,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:36:21,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:36:21,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:36:21,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:36:21,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:36:21,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:36:21,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:36:21,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:36:21,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:36:21,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:36:21,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:36:21,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:36:21,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:36:21,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:36:21,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:36:21,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:36:21,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:36:21,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:36:21,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:36:21,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:36:21,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:36:21,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:36:21,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:36:21,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:36:21,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:36:21,500 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:36:21,501 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:36:21,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2019-08-05 10:36:21,502 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2019-08-05 10:36:21,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:36:21,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:36:21,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:21,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:36:21,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:36:21,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,571 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:36:21,572 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:36:21,572 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:36:21,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:21,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:36:21,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:36:21,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:36:21,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... [2019-08-05 10:36:21,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:36:21,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:36:21,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:36:21,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:36:21,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:36:21,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:36:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:36:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:36:21,885 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:36:21,885 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:36:21,886 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:21 BoogieIcfgContainer [2019-08-05 10:36:21,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:36:21,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:36:21,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:36:21,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:36:21,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:21" (1/2) ... [2019-08-05 10:36:21,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5105022e and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:36:21, skipping insertion in model container [2019-08-05 10:36:21,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:21" (2/2) ... [2019-08-05 10:36:21,895 INFO L109 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2019-08-05 10:36:21,905 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:36:21,913 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:36:21,930 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:36:21,954 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:36:21,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:36:21,955 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:36:21,955 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:36:21,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:36:21,955 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:36:21,956 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:36:21,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:36:21,956 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:36:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:36:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:36:21,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:21,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:36:21,980 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 10:36:22,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:22,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:36:22,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:36:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:36:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:22,124 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:36:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,171 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:36:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:36:22,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:36:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,186 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:36:22,186 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:36:22,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:36:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:36:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:36:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:36:22,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:36:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,221 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:36:22,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:36:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:36:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:36:22,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:36:22,223 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-08-05 10:36:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:36:22,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:36:22,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:36:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:22,446 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:36:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,594 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:36:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:36:22,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:36:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,597 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:36:22,597 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:36:22,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:36:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:36:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:36:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:36:22,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:36:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,601 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:36:22,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:36:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:36:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:36:22,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,602 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:36:22,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2019-08-05 10:36:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:36:22,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:36:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:36:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:36:22,729 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:36:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,814 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:36:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:36:22,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:36:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,816 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:36:22,816 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:36:22,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:36:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:36:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:36:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:36:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:36:22,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:36:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,819 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:36:22,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:36:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:36:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:36:22,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,820 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:36:22,820 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2019-08-05 10:36:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:36:22,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:36:22,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:36:22,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:22,946 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:36:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:23,039 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:36:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:36:23,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:36:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:23,040 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:36:23,040 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:36:23,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:36:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:36:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:36:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:36:23,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:36:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:23,043 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:36:23,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:36:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:36:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:36:23,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:23,044 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:36:23,045 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2019-08-05 10:36:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:23,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:36:23,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:36:23,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:36:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:23,376 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:36:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:23,465 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:36:23,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:36:23,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:36:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:23,466 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:36:23,467 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:36:23,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:36:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:36:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:36:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:36:23,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:36:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:23,470 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:36:23,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:36:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:36:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:36:23,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:23,471 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:36:23,473 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2019-08-05 10:36:23,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:23,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:36:23,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:36:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:36:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:36:23,652 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:36:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:23,812 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:36:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:36:23,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:36:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:23,814 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:36:23,814 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:36:23,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:36:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:36:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:36:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:36:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:36:23,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:36:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:23,817 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:36:23,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:36:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:36:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:36:23,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:23,818 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:36:23,819 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2019-08-05 10:36:23,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:24,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:24,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:36:24,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:36:24,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:36:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:24,011 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:36:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:24,133 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:36:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:36:24,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:36:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:24,134 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:36:24,134 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:36:24,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:36:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:36:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:36:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:36:24,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:36:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:24,138 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:36:24,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:36:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:36:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:36:24,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:24,139 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:36:24,140 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2019-08-05 10:36:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:24,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:36:24,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:24,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:24,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:36:24,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:36:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:36:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:24,411 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:36:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:24,770 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:36:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:36:24,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:36:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:24,772 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:36:24,772 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:36:24,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:36:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:36:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:36:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:36:24,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:36:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:24,775 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:36:24,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:36:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:36:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:36:24,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:24,776 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:36:24,776 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2019-08-05 10:36:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:24,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:36:24,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:36:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:24,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:36:24,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:36:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:36:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:24,920 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 10:36:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,104 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:36:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:36:25,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 10:36:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,106 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:36:25,106 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:36:25,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:36:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2019-08-05 10:36:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:36:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 10:36:25,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-08-05 10:36:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,112 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 10:36:25,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:36:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 10:36:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:36:25,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,113 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:36:25,113 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2019-08-05 10:36:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:36:25,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:36:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:36:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:25,340 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2019-08-05 10:36:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,525 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-05 10:36:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:36:25,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:36:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,530 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:36:25,530 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:36:25,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:36:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:36:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:36:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-08-05 10:36:25,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-08-05 10:36:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,535 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-08-05 10:36:25,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:36:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-08-05 10:36:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:36:25,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,536 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:36:25,536 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2019-08-05 10:36:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:36:25,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:36:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:36:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:36:25,788 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2019-08-05 10:36:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,959 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:36:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:36:25,960 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:36:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,962 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:36:25,962 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:36:25,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:36:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:36:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:36:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:36:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-08-05 10:36:25,967 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2019-08-05 10:36:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,968 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-08-05 10:36:25,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:36:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-08-05 10:36:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:36:25,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,969 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:36:25,969 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2019-08-05 10:36:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:26,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:36:26,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:36:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:36:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:26,358 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2019-08-05 10:36:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:26,549 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 10:36:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:36:26,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:36:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:26,553 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:36:26,553 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:36:26,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:36:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:36:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:36:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-08-05 10:36:26,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2019-08-05 10:36:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:26,558 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-08-05 10:36:26,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:36:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2019-08-05 10:36:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:36:26,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:26,559 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:36:26,559 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2019-08-05 10:36:26,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:26,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:36:26,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:26,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:26,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:36:26,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:36:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:36:26,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:26,943 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2019-08-05 10:36:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,264 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-08-05 10:36:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:36:27,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:36:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,265 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:36:27,266 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:36:27,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:36:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:36:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:36:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-08-05 10:36:27,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2019-08-05 10:36:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,270 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-08-05 10:36:27,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:36:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-08-05 10:36:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:36:27,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,271 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:36:27,271 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2019-08-05 10:36:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:27,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:27,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:36:27,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:36:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:36:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:27,546 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2019-08-05 10:36:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,786 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-08-05 10:36:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:36:27,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:36:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,789 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:36:27,789 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:36:27,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:36:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:36:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:36:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 10:36:27,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2019-08-05 10:36:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,793 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 10:36:27,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:36:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 10:36:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:36:27,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:27,794 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:36:27,794 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2019-08-05 10:36:27,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:27,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:36:27,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:36:28,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:36:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:36:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:28,049 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2019-08-05 10:36:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:28,367 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-08-05 10:36:28,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:36:28,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:36:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:28,368 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:36:28,369 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:36:28,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:36:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:36:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:36:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-08-05 10:36:28,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-08-05 10:36:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:28,372 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-08-05 10:36:28,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:36:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-08-05 10:36:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:36:28,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:28,374 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:36:28,374 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2019-08-05 10:36:28,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:28,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:36:28,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:36:29,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:36:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:36:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:29,135 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-08-05 10:36:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:29,621 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-08-05 10:36:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:36:29,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:36:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:29,623 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:36:29,623 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:36:29,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:36:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:36:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:36:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 10:36:29,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2019-08-05 10:36:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:29,627 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 10:36:29,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:36:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 10:36:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:36:29,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:29,628 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:36:29,629 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2019-08-05 10:36:29,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:29,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:36:29,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:30,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:30,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:36:30,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:36:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:36:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:30,204 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2019-08-05 10:36:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,590 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-08-05 10:36:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:36:30,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:36:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,593 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:36:30,593 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:36:30,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:36:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:36:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:36:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-08-05 10:36:30,597 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2019-08-05 10:36:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,597 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-08-05 10:36:30,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:36:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-08-05 10:36:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:36:30,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,598 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:36:30,598 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2019-08-05 10:36:30,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:31,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:31,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:36:31,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:36:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:36:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:31,132 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2019-08-05 10:36:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,614 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-08-05 10:36:31,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:36:31,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:36:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,615 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:36:31,615 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:36:31,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:36:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:36:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:36:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-08-05 10:36:31,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2019-08-05 10:36:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,619 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-08-05 10:36:31,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:36:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-08-05 10:36:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:36:31,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,620 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:36:31,620 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2019-08-05 10:36:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:32,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:36:32,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:36:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:36:32,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:32,159 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 22 states. [2019-08-05 10:36:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,648 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-08-05 10:36:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:36:32,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:36:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,650 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:36:32,650 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:36:32,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:36:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:36:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:36:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:36:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-08-05 10:36:32,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 22 [2019-08-05 10:36:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,655 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-08-05 10:36:32,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:36:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-08-05 10:36:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:36:32,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,656 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:36:32,656 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 19 times [2019-08-05 10:36:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:32,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:36:32,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:36:33,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:36:33,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:36:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:33,136 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 23 states. [2019-08-05 10:36:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:33,793 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-08-05 10:36:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:36:33,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:36:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:33,795 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:36:33,795 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:36:33,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:36:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:36:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:36:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:36:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-08-05 10:36:33,800 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2019-08-05 10:36:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:33,800 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-08-05 10:36:33,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:36:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-08-05 10:36:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:36:33,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:33,802 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:36:33,802 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 20 times [2019-08-05 10:36:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:34,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:36:34,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:36:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:36:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:34,301 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 24 states. [2019-08-05 10:36:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:34,911 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-08-05 10:36:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:36:34,912 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:36:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:34,912 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:36:34,912 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:36:34,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:36:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:36:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:36:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:36:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-08-05 10:36:34,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2019-08-05 10:36:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:34,917 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-08-05 10:36:34,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:36:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-08-05 10:36:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:36:34,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:34,918 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:36:34,918 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 21 times [2019-08-05 10:36:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:34,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:36:34,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:35,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:36:35,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:36:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:36:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:36:35,391 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 25 states. [2019-08-05 10:36:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:36,042 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-08-05 10:36:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:36:36,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:36:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:36,046 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:36:36,046 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:36:36,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:36:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:36:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:36:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:36:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-08-05 10:36:36,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2019-08-05 10:36:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:36,049 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-08-05 10:36:36,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:36:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-08-05 10:36:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:36:36,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:36,050 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:36:36,051 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 22 times [2019-08-05 10:36:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:36,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:36:36,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:36,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:36:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:36:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:36:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:36,758 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 26 states. [2019-08-05 10:36:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,857 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-08-05 10:36:37,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:36:37,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:36:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,859 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:36:37,859 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:36:37,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:36:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:36:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:36:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:36:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-08-05 10:36:37,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2019-08-05 10:36:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,863 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-08-05 10:36:37,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:36:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-08-05 10:36:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:36:37,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,864 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:36:37,864 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 23 times [2019-08-05 10:36:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:38,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:38,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:36:38,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:36:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:36:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:38,615 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2019-08-05 10:36:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:39,532 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-08-05 10:36:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:36:39,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:36:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:39,533 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:36:39,533 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:36:39,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:36:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:36:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:36:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:36:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-08-05 10:36:39,537 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2019-08-05 10:36:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:39,537 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-08-05 10:36:39,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:36:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-08-05 10:36:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:36:39,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:39,538 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:36:39,538 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 24 times [2019-08-05 10:36:39,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:39,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:36:39,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:40,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:40,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:36:40,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:36:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:36:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:36:40,312 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 29 states. [2019-08-05 10:36:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:41,127 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-08-05 10:36:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:36:41,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:36:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:41,129 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:36:41,129 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:36:41,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:36:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:36:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:36:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:36:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-08-05 10:36:41,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 29 [2019-08-05 10:36:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:41,133 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-08-05 10:36:41,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:36:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-08-05 10:36:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:36:41,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:41,134 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:36:41,134 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:41,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 25 times [2019-08-05 10:36:41,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:41,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:36:41,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:42,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:36:42,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:36:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:36:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:42,451 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 30 states. [2019-08-05 10:36:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:43,320 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-08-05 10:36:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:36:43,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:36:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:43,321 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:36:43,321 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:36:43,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:36:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:36:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:36:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-08-05 10:36:43,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 30 [2019-08-05 10:36:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:43,324 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-08-05 10:36:43,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:36:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-08-05 10:36:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:36:43,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:43,325 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:36:43,325 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 26 times [2019-08-05 10:36:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:36:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:44,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:36:44,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:36:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:36:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:44,178 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 31 states. [2019-08-05 10:36:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:45,138 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-08-05 10:36:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:36:45,138 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:36:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:45,139 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:36:45,139 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:36:45,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:36:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:36:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:36:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-08-05 10:36:45,143 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2019-08-05 10:36:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:45,143 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-08-05 10:36:45,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:36:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-08-05 10:36:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:36:45,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:45,144 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:36:45,144 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 27 times [2019-08-05 10:36:45,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:45,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:36:45,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:45,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:45,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:36:45,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:36:45,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:36:45,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:45,901 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 32 states. [2019-08-05 10:36:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:46,891 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-08-05 10:36:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:36:46,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:36:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:46,893 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:36:46,893 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:36:46,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:36:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:36:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-08-05 10:36:46,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2019-08-05 10:36:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-08-05 10:36:46,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:36:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-08-05 10:36:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:36:46,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:46,897 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:36:46,897 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 28 times [2019-08-05 10:36:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:46,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:36:46,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:47,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:36:47,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:36:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:36:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:47,978 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 33 states. [2019-08-05 10:36:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,077 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-08-05 10:36:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:36:49,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:36:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,079 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:49,079 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:49,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:36:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:36:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-08-05 10:36:49,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 33 [2019-08-05 10:36:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,083 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-08-05 10:36:49,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:36:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-08-05 10:36:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:36:49,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,084 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:36:49,085 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 29 times [2019-08-05 10:36:49,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:49,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:49,915 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2019-08-05 10:36:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,053 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-08-05 10:36:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:51,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:36:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,055 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:36:51,055 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:36:51,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:36:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:36:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:36:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-08-05 10:36:51,058 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2019-08-05 10:36:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,058 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-08-05 10:36:51,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-08-05 10:36:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:36:51,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,059 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:36:51,059 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 30 times [2019-08-05 10:36:51,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:51,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:51,942 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 36 states. [2019-08-05 10:36:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,221 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-08-05 10:36:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:53,221 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:36:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,222 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:36:53,222 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:36:53,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:36:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:36:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:36:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-08-05 10:36:53,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2019-08-05 10:36:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,226 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-08-05 10:36:53,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-08-05 10:36:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:36:53,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,227 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:36:53,227 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:53,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 31 times [2019-08-05 10:36:53,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:54,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:54,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:54,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:54,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:54,641 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 37 states. [2019-08-05 10:36:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:55,992 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-08-05 10:36:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:55,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:36:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:55,993 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:36:55,993 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:36:55,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:36:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:36:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:36:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-08-05 10:36:55,997 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2019-08-05 10:36:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:55,997 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-08-05 10:36:55,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-08-05 10:36:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:36:55,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:55,998 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:36:55,998 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:55,999 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 32 times [2019-08-05 10:36:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:57,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:57,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:57,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:57,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:57,045 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 38 states. [2019-08-05 10:36:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:58,479 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-08-05 10:36:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:58,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:36:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:58,481 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:36:58,481 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:36:58,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:36:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:36:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:36:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-08-05 10:36:58,484 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 38 [2019-08-05 10:36:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:58,484 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-08-05 10:36:58,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-08-05 10:36:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:36:58,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:58,485 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:36:58,485 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 33 times [2019-08-05 10:36:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:58,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:36:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:59,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:59,787 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 39 states. [2019-08-05 10:37:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,275 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-08-05 10:37:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:37:01,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:37:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,277 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:37:01,277 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:37:01,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:37:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:37:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:37:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:37:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-08-05 10:37:01,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2019-08-05 10:37:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,280 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-08-05 10:37:01,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:37:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-08-05 10:37:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:37:01,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,281 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:37:01,281 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 34 times [2019-08-05 10:37:01,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:02,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:02,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:37:02,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:37:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:37:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:37:02,444 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 40 states. [2019-08-05 10:37:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:04,058 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-08-05 10:37:04,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:37:04,058 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:37:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:04,059 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:37:04,059 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:37:04,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:37:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:37:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:37:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:37:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-08-05 10:37:04,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 40 [2019-08-05 10:37:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:04,063 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-08-05 10:37:04,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:37:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-08-05 10:37:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:37:04,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:04,063 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:37:04,064 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 35 times [2019-08-05 10:37:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:04,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:37:04,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:06,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:06,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:37:06,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:37:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:37:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:37:06,537 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 41 states. [2019-08-05 10:37:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:08,207 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-08-05 10:37:08,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:37:08,208 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:37:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:08,209 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:37:08,209 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:37:08,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:37:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:37:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:37:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:37:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-08-05 10:37:08,212 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 41 [2019-08-05 10:37:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:08,212 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-08-05 10:37:08,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:37:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-08-05 10:37:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:37:08,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:08,213 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:37:08,213 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 36 times [2019-08-05 10:37:08,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:08,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:37:08,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:37:09,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:37:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:37:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:37:09,583 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 42 states. [2019-08-05 10:37:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:11,339 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-08-05 10:37:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:37:11,340 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:37:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:11,341 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:37:11,341 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:37:11,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:37:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:37:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:37:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:37:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-08-05 10:37:11,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2019-08-05 10:37:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:11,346 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-08-05 10:37:11,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:37:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-08-05 10:37:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:37:11,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:11,346 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:37:11,347 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 37 times [2019-08-05 10:37:11,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:11,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:37:11,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:12,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:12,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:12,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:12,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:12,641 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 44 states. [2019-08-05 10:37:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:14,633 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-08-05 10:37:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:14,633 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:37:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:14,634 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:37:14,634 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:37:14,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:37:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:37:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:37:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-08-05 10:37:14,638 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 44 [2019-08-05 10:37:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:14,639 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-08-05 10:37:14,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-08-05 10:37:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:37:14,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:14,639 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:37:14,640 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 38 times [2019-08-05 10:37:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:14,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:16,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:16,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:16,007 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 45 states. [2019-08-05 10:37:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:18,049 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-08-05 10:37:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:18,050 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:37:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:18,051 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:37:18,051 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:37:18,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:37:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:37:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:37:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-08-05 10:37:18,054 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 45 [2019-08-05 10:37:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:18,055 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-08-05 10:37:18,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-08-05 10:37:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:37:18,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:18,055 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:37:18,056 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:18,056 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 39 times [2019-08-05 10:37:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:18,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:37:18,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:19,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:19,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:19,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:19,591 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 46 states. [2019-08-05 10:37:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:21,733 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-08-05 10:37:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:21,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:37:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:21,734 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:37:21,734 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:37:21,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:37:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:37:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:37:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-08-05 10:37:21,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 46 [2019-08-05 10:37:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:21,737 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-08-05 10:37:21,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-08-05 10:37:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:37:21,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:21,738 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:37:21,738 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 40 times [2019-08-05 10:37:21,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:21,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:37:21,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:23,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:23,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:23,208 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 47 states. [2019-08-05 10:37:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:25,492 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-08-05 10:37:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:25,493 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:37:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:25,493 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:37:25,494 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:37:25,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:37:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:37:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:37:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-08-05 10:37:25,498 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 47 [2019-08-05 10:37:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:25,498 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-08-05 10:37:25,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-08-05 10:37:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:37:25,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:25,499 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:37:25,499 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 41 times [2019-08-05 10:37:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:25,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:25,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:27,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:27,150 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 48 states. [2019-08-05 10:37:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:29,459 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-08-05 10:37:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:29,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:37:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:29,460 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:37:29,460 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:37:29,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:37:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:37:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:37:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-08-05 10:37:29,463 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 48 [2019-08-05 10:37:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:29,463 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-08-05 10:37:29,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-08-05 10:37:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:37:29,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:29,464 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:37:29,464 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 42 times [2019-08-05 10:37:29,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:29,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:37:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:31,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:31,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:31,211 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 49 states. [2019-08-05 10:37:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:33,627 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-08-05 10:37:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:33,628 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:37:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:33,629 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:37:33,629 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:37:33,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:37:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:37:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:37:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-08-05 10:37:33,632 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 49 [2019-08-05 10:37:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:33,632 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-08-05 10:37:33,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-08-05 10:37:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:37:33,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:33,633 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:37:33,633 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 43 times [2019-08-05 10:37:33,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:33,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:37:33,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:35,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:37:35,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:35,439 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 50 states. [2019-08-05 10:37:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:37,954 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-08-05 10:37:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:37,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:37:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:37,955 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:37:37,956 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:37:37,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:37:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:37:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:37:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-08-05 10:37:37,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 50 [2019-08-05 10:37:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:37,959 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-08-05 10:37:37,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-08-05 10:37:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:37:37,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:37,960 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:37:37,960 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 44 times [2019-08-05 10:37:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:37,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:37:37,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:39,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:39,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:37:39,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:37:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:37:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:39,699 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 52 states. [2019-08-05 10:37:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:42,487 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-08-05 10:37:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:37:42,487 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:37:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:42,488 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:37:42,488 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:37:42,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:37:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:37:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:37:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-08-05 10:37:42,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 52 [2019-08-05 10:37:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:42,492 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-08-05 10:37:42,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:37:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-08-05 10:37:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:37:42,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:42,493 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:37:42,493 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 45 times [2019-08-05 10:37:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:42,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:37:42,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:44,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:37:44,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:37:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:37:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:44,526 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 53 states. [2019-08-05 10:37:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,381 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-08-05 10:37:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:37:47,382 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:37:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,383 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:37:47,383 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:37:47,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:37:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:37:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:37:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-08-05 10:37:47,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 53 [2019-08-05 10:37:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,386 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-08-05 10:37:47,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:37:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-08-05 10:37:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:37:47,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,387 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:37:47,387 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 46 times [2019-08-05 10:37:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:49,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:49,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:37:49,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:37:49,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:37:49,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:49,443 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 54 states. [2019-08-05 10:37:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:52,445 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2019-08-05 10:37:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:37:52,446 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:37:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:52,447 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:37:52,447 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:37:52,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:37:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:37:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:37:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-08-05 10:37:52,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 54 [2019-08-05 10:37:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:52,451 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-08-05 10:37:52,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:37:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-08-05 10:37:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:37:52,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:52,452 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:37:52,452 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 47 times [2019-08-05 10:37:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:52,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:37:52,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:54,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:37:54,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:37:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:37:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:54,528 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 55 states. [2019-08-05 10:37:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,652 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-08-05 10:37:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:37:57,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:37:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,654 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:37:57,654 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:37:57,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:37:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:37:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:37:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-08-05 10:37:57,657 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 55 [2019-08-05 10:37:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,657 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-08-05 10:37:57,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:37:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-08-05 10:37:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:37:57,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,658 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:37:57,658 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 48 times [2019-08-05 10:37:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:37:59,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:37:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:37:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:37:59,737 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 56 states. [2019-08-05 10:38:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:02,969 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-08-05 10:38:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:38:02,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:38:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:02,971 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:38:02,971 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:38:02,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:38:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:38:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:38:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:38:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-08-05 10:38:02,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 56 [2019-08-05 10:38:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:02,975 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-08-05 10:38:02,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:38:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-08-05 10:38:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:38:02,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:02,976 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:38:02,976 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:02,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 49 times [2019-08-05 10:38:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:03,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:38:03,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:05,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:05,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:38:05,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:38:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:38:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:38:05,148 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 57 states. [2019-08-05 10:38:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:08,474 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-08-05 10:38:08,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:38:08,475 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:38:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:08,475 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:38:08,476 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:38:08,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:38:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:38:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:38:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:38:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-08-05 10:38:08,479 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 57 [2019-08-05 10:38:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:08,479 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-08-05 10:38:08,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:38:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-08-05 10:38:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:38:08,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:08,480 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:38:08,481 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 50 times [2019-08-05 10:38:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:08,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:38:08,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:38:10,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:38:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:38:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:38:10,768 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 58 states. [2019-08-05 10:38:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:14,242 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-08-05 10:38:14,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:38:14,242 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:38:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:14,244 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:38:14,244 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:38:14,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:38:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:38:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:38:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:38:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-08-05 10:38:14,247 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 58 [2019-08-05 10:38:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:14,248 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-08-05 10:38:14,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:38:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-08-05 10:38:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:38:14,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:14,248 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:38:14,249 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 51 times [2019-08-05 10:38:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:14,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:38:14,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:16,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:38:16,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:38:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:38:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:38:16,869 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 60 states. [2019-08-05 10:38:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,516 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-08-05 10:38:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:38:20,517 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:38:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,518 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:38:20,518 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:38:20,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:38:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:38:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:38:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:38:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-08-05 10:38:20,521 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 60 [2019-08-05 10:38:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:20,522 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-08-05 10:38:20,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:38:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-08-05 10:38:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:38:20,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:20,522 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:38:20,522 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 52 times [2019-08-05 10:38:20,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:23,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:38:23,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:38:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:38:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:23,273 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 61 states. [2019-08-05 10:38:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:27,145 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-08-05 10:38:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:38:27,149 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:38:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:27,150 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:38:27,150 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:38:27,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:38:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:38:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:38:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-08-05 10:38:27,152 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 61 [2019-08-05 10:38:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-08-05 10:38:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:38:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-08-05 10:38:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:38:27,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:27,154 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:38:27,154 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 53 times [2019-08-05 10:38:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:27,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:38:27,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:29,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:29,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:38:29,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:38:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:38:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:29,688 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 62 states. [2019-08-05 10:38:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:33,661 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-08-05 10:38:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:38:33,662 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:38:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:33,662 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:38:33,663 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:38:33,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:38:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:38:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:38:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-08-05 10:38:33,665 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 62 [2019-08-05 10:38:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:33,666 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-08-05 10:38:33,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:38:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-08-05 10:38:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:38:33,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:33,667 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:38:33,667 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 54 times [2019-08-05 10:38:33,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:33,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:38:33,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:36,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:36,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:38:36,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:38:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:38:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:36,344 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 63 states. [2019-08-05 10:38:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:40,414 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-08-05 10:38:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:38:40,414 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:38:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:40,415 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:38:40,415 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:38:40,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:38:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:38:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:38:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-08-05 10:38:40,417 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 63 [2019-08-05 10:38:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:40,418 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-08-05 10:38:40,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:38:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-08-05 10:38:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:38:40,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:40,418 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:38:40,419 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 55 times [2019-08-05 10:38:40,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:40,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:38:40,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:38:43,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:38:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:38:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:43,230 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 64 states. [2019-08-05 10:38:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:47,502 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-08-05 10:38:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:38:47,503 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:38:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:47,503 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:38:47,504 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:38:47,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:38:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:38:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:38:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-08-05 10:38:47,506 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 64 [2019-08-05 10:38:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:47,506 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-08-05 10:38:47,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:38:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-08-05 10:38:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:38:47,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:47,507 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:38:47,508 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 56 times [2019-08-05 10:38:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:47,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:38:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:50,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:38:50,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:38:50,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:38:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:38:50,412 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 65 states. [2019-08-05 10:38:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:54,794 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-08-05 10:38:54,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:38:54,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:38:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:54,796 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:38:54,796 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:38:54,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:38:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:38:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:38:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:38:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-08-05 10:38:54,799 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 65 [2019-08-05 10:38:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:54,799 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-08-05 10:38:54,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:38:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-08-05 10:38:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:38:54,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:54,800 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:38:54,800 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 57 times [2019-08-05 10:38:54,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:59,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:59,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:38:59,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:38:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:38:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:38:59,089 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 66 states. [2019-08-05 10:39:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:03,611 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-05 10:39:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:39:03,612 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:39:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:03,613 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:39:03,613 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:39:03,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:39:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:39:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:39:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:39:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-08-05 10:39:03,616 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-08-05 10:39:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:03,616 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-08-05 10:39:03,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:39:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-08-05 10:39:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:39:03,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:03,617 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:39:03,618 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 58 times [2019-08-05 10:39:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:03,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:39:03,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:06,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:39:06,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:39:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:39:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:39:06,571 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 68 states. [2019-08-05 10:39:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:11,345 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-08-05 10:39:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:39:11,346 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:39:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:11,347 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:39:11,347 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:39:11,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:39:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:39:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:39:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:39:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-08-05 10:39:11,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 68 [2019-08-05 10:39:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:11,349 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-08-05 10:39:11,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:39:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-08-05 10:39:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:39:11,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:11,350 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:39:11,350 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 59 times [2019-08-05 10:39:11,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:11,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:39:11,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:39:14,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:39:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:39:14,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:39:14,640 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 69 states. [2019-08-05 10:39:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:19,615 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-08-05 10:39:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:39:19,616 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:39:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:19,617 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:39:19,617 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:39:19,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:39:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:39:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:39:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:39:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-08-05 10:39:19,620 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 69 [2019-08-05 10:39:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:19,620 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-08-05 10:39:19,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:39:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-08-05 10:39:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:39:19,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:19,621 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:39:19,621 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 60 times [2019-08-05 10:39:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:19,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:39:19,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:23,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:39:23,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:39:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:39:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:39:23,189 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 70 states. [2019-08-05 10:39:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:28,152 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-08-05 10:39:28,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:39:28,153 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:39:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:28,154 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:39:28,154 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:39:28,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:39:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:39:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:39:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:39:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-08-05 10:39:28,157 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 70 [2019-08-05 10:39:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:28,157 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-08-05 10:39:28,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:39:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-08-05 10:39:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:39:28,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:28,158 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:39:28,159 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 61 times [2019-08-05 10:39:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:39:31,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:39:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:39:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:39:31,448 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 71 states. [2019-08-05 10:39:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:36,489 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-08-05 10:39:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:39:36,490 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:39:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:36,490 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:39:36,491 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:39:36,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:39:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:39:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:39:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:39:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2019-08-05 10:39:36,493 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 71 [2019-08-05 10:39:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:36,494 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2019-08-05 10:39:36,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:39:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2019-08-05 10:39:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:39:36,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:36,495 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:39:36,496 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 62 times [2019-08-05 10:39:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:36,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:39:36,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:40,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:39:40,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:39:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:39:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:39:40,122 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 72 states. [2019-08-05 10:39:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,902 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-08-05 10:39:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:39:45,902 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:39:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,904 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:39:45,904 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:39:45,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:39:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:39:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:39:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:39:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-08-05 10:39:45,907 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 72 [2019-08-05 10:39:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:45,908 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-08-05 10:39:45,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:39:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-08-05 10:39:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:39:45,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:45,908 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:39:45,909 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 63 times [2019-08-05 10:39:45,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:45,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:39:45,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:50,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:39:50,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:39:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:39:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:39:50,007 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 73 states. [2019-08-05 10:39:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,596 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-08-05 10:39:55,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:39:55,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:39:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,597 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:39:55,598 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:39:55,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:39:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:39:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:39:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:39:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-08-05 10:39:55,601 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2019-08-05 10:39:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,602 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-08-05 10:39:55,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:39:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-08-05 10:39:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:39:55,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,602 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:39:55,603 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 64 times [2019-08-05 10:39:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:59,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:59,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:39:59,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:39:59,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:39:59,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:39:59,305 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 74 states. [2019-08-05 10:40:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:05,042 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-08-05 10:40:05,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:40:05,042 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:40:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:05,043 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:40:05,043 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:40:05,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:40:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:40:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:40:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:40:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-08-05 10:40:05,046 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 74 [2019-08-05 10:40:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:05,047 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-08-05 10:40:05,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:40:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-08-05 10:40:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:40:05,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:05,047 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:40:05,048 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 65 times [2019-08-05 10:40:05,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:05,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:40:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:08,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:08,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:40:08,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:40:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:40:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:40:08,908 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 76 states. [2019-08-05 10:40:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:14,882 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-08-05 10:40:14,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:40:14,883 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:40:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:14,884 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:40:14,884 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:40:14,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:40:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:40:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:40:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:40:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-08-05 10:40:14,887 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 76 [2019-08-05 10:40:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:14,888 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-08-05 10:40:14,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:40:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-08-05 10:40:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:40:14,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:14,888 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:40:14,888 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 66 times [2019-08-05 10:40:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:14,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:40:14,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:20,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:20,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:40:20,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:40:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:40:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:40:20,188 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 77 states. [2019-08-05 10:40:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:26,354 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-08-05 10:40:26,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:40:26,355 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:40:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:26,356 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:40:26,356 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:40:26,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:40:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:40:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:40:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:40:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2019-08-05 10:40:26,358 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 77 [2019-08-05 10:40:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:26,359 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2019-08-05 10:40:26,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:40:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2019-08-05 10:40:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:40:26,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:26,359 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:40:26,360 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 67 times [2019-08-05 10:40:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:26,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:40:26,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:30,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:30,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:40:30,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:40:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:40:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:40:30,292 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 78 states. [2019-08-05 10:40:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:36,620 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-08-05 10:40:36,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:40:36,621 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:40:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:36,622 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:40:36,622 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:40:36,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:40:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:40:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:40:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:40:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-08-05 10:40:36,624 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 78 [2019-08-05 10:40:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:36,625 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-08-05 10:40:36,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:40:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-08-05 10:40:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:40:36,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:36,626 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:40:36,627 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 68 times [2019-08-05 10:40:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:36,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:40:36,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:41,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:41,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:40:41,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:40:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:40:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:40:41,151 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 79 states. Received shutdown request... [2019-08-05 10:40:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:40:41,925 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:40:41,931 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:40:41,932 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:40:41 BoogieIcfgContainer [2019-08-05 10:40:41,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:40:41,936 INFO L168 Benchmark]: Toolchain (without parser) took 260395.38 ms. Allocated memory was 141.0 MB in the beginning and 144.2 MB in the end (delta: 3.1 MB). Free memory was 110.5 MB in the beginning and 43.3 MB in the end (delta: 67.3 MB). Peak memory consumption was 70.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,937 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.81 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,938 INFO L168 Benchmark]: Boogie Preprocessor took 23.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.6 MB in the end (delta: 969.7 kB). Peak memory consumption was 969.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,941 INFO L168 Benchmark]: RCFGBuilder took 286.71 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 98.9 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,941 INFO L168 Benchmark]: TraceAbstraction took 260044.06 ms. Allocated memory was 141.0 MB in the beginning and 144.2 MB in the end (delta: 3.1 MB). Free memory was 98.7 MB in the beginning and 43.3 MB in the end (delta: 55.4 MB). Peak memory consumption was 58.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:41,944 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.0 MB. Free memory was 111.7 MB in the beginning and 111.5 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.81 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.6 MB in the end (delta: 969.7 kB). Peak memory consumption was 969.7 kB. Max. memory is 7.1 GB. * RCFGBuilder took 286.71 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 98.9 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260044.06 ms. Allocated memory was 141.0 MB in the beginning and 144.2 MB in the end (delta: 3.1 MB). Free memory was 98.7 MB in the beginning and 43.3 MB in the end (delta: 55.4 MB). Peak memory consumption was 58.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (87states) and FLOYD_HOARE automaton (currently 10 states, 79 states before enhancement),while ReachableStatesComputation was computing reachable states (8 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 259.9s OverallTime, 69 OverallIterations, 76 TraceHistogramMax, 147.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 83 SDslu, 2549 SDs, 0 SdLazy, 136048 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2712 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=68, 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.1s AutomataMinimizationTime, 68 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 110.2s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2712 ConstructedInterpolants, 0 QuantifiedInterpolants, 969686 SizeOfPredicates, 67 NumberOfNonLiveVariables, 10917 ConjunctsInSsa, 5355 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 1/66812 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown