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/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:32,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:32,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:32,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:32,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:32,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:32,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:32,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:32,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:32,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:32,675 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:32,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:32,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:32,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:32,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:32,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:32,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:32,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:32,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:32,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:32,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:32,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:32,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:32,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:32,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:32,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:32,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:32,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:32,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:32,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:32,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:32,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:32,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:32,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:32,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:32,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:32,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:32,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:32,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:32,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:32,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:32,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:32,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:32,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:32,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:32,777 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:32,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl [2019-08-05 10:15:32,778 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl' [2019-08-05 10:15:32,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:32,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:32,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:32,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:32,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:32,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:32,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:32,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:32,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:32,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/1) ... [2019-08-05 10:15:32,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:32,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:32,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:32,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:32,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (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:15:32,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:33,178 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:15:33,181 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:33,181 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:15:33,182 INFO L202 PluginConnector]: Adding new model cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:33 BoogieIcfgContainer [2019-08-05 10:15:33,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:33,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:33,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:33,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:33,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:32" (1/2) ... [2019-08-05 10:15:33,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e20c477 and model type cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:33, skipping insertion in model container [2019-08-05 10:15:33,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:33" (2/2) ... [2019-08-05 10:15:33,190 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.c.i_4.bpl [2019-08-05 10:15:33,200 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:33,208 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:33,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:33,251 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:33,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:33,252 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:33,252 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:33,252 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:33,253 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:33,253 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:33,253 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:33,253 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:15:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:15:33,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:15:33,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:15:33,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,426 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:15:33,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:33,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:33,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:33,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:33,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:33,449 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:15:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:33,495 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-08-05 10:15:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:33,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:15:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:33,513 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:15:33,513 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:15:33,515 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:15:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:15:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:15:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:15:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:15:33,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:15:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:33,571 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:15:33,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:15:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:15:33,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:15:33,573 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-08-05 10:15:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:33,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:33,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:33,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:33,652 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:15:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:33,698 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:15:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:33,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:15:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:33,703 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:15:33,703 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:15:33,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:15:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:15:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:15:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:15:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:15:33,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:15:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:33,708 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:15:33,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:15:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:15:33,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:15:33,709 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-08-05 10:15:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:15:33,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:15:33,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:33,791 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:15:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:33,833 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 10:15:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:33,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:15:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:33,834 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:15:33,834 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:15:33,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:15:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:15:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:15:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:15:33,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 10:15:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:33,838 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:15:33,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:15:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:15:33,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,840 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:15:33,840 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 610875506, now seen corresponding path program 2 times [2019-08-05 10:15:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:33,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:33,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:33,933 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2019-08-05 10:15:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,049 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 10:15:34,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:34,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:15:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,051 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:15:34,051 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:15:34,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:15:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:15:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:15:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 10:15:34,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-08-05 10:15:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,055 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 10:15:34,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 10:15:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:15:34,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,067 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 10:15:34,068 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1821689139, now seen corresponding path program 3 times [2019-08-05 10:15:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:15:34,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:34,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:34,151 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-08-05 10:15:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,247 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-08-05 10:15:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:34,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:15:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,249 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:15:34,249 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:15:34,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:15:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:15:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:15:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-08-05 10:15:34,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2019-08-05 10:15:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,253 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-08-05 10:15:34,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-08-05 10:15:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:15:34,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,254 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1] [2019-08-05 10:15:34,254 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1703328677, now seen corresponding path program 4 times [2019-08-05 10:15:34,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:15:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:34,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:34,552 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 6 states. [2019-08-05 10:15:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,686 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:15:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:34,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:15:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,688 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:15:34,688 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:15:34,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:15:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:15:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:15:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-05 10:15:34,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2019-08-05 10:15:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,691 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-05 10:15:34,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-05 10:15:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:15:34,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,692 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1] [2019-08-05 10:15:34,693 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash 510260218, now seen corresponding path program 5 times [2019-08-05 10:15:34,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:34,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:34,807 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 6 states. [2019-08-05 10:15:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,873 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-08-05 10:15:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:34,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 10:15:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,875 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:15:34,875 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:15:34,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:15:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:15:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:15:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-08-05 10:15:34,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2019-08-05 10:15:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,883 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-08-05 10:15:34,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2019-08-05 10:15:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:15:34,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,885 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1] [2019-08-05 10:15:34,885 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 733863266, now seen corresponding path program 6 times [2019-08-05 10:15:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:35,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:35,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:35,266 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 7 states. [2019-08-05 10:15:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:35,318 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:15:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:35,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:15:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:35,321 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:15:35,321 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:15:35,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:15:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:15:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:15:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:15:35,325 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2019-08-05 10:15:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:35,325 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:15:35,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:15:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:35,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:35,327 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1] [2019-08-05 10:15:35,327 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 868027594, now seen corresponding path program 7 times [2019-08-05 10:15:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:35,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:15:35,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:35,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:35,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:35,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:35,499 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 8 states. [2019-08-05 10:15:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:35,602 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:15:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:35,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-05 10:15:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:35,604 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:15:35,604 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:15:35,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:15:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:15:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:15:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 10:15:35,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2019-08-05 10:15:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:35,609 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 10:15:35,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 10:15:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:15:35,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:35,610 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1] [2019-08-05 10:15:35,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 950927922, now seen corresponding path program 8 times [2019-08-05 10:15:35,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:35,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:15:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:36,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:36,005 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 9 states. [2019-08-05 10:15:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,042 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-08-05 10:15:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:36,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:15:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,044 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:15:36,044 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:15:36,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:15:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:15:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:15:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-08-05 10:15:36,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 18 [2019-08-05 10:15:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,048 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-08-05 10:15:36,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-08-05 10:15:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:15:36,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,049 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1] [2019-08-05 10:15:36,049 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash -986235494, now seen corresponding path program 9 times [2019-08-05 10:15:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:36,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:36,220 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 10 states. [2019-08-05 10:15:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,288 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2019-08-05 10:15:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:15:36,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-05 10:15:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,289 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:15:36,289 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:15:36,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:15:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:15:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:15:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-08-05 10:15:36,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 20 [2019-08-05 10:15:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,294 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-08-05 10:15:36,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-08-05 10:15:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:15:36,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,295 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1] [2019-08-05 10:15:36,295 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1415528194, now seen corresponding path program 10 times [2019-08-05 10:15:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:36,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:15:36,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:15:36,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:15:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:36,481 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 11 states. [2019-08-05 10:15:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,534 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-08-05 10:15:36,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:15:36,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-08-05 10:15:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,536 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:15:36,536 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:15:36,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:15:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:15:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:15:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-08-05 10:15:36,540 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 22 [2019-08-05 10:15:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,541 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-08-05 10:15:36,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:15:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-08-05 10:15:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:15:36,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,542 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1] [2019-08-05 10:15:36,542 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1181972886, now seen corresponding path program 11 times [2019-08-05 10:15:36,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:36,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:15:36,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:15:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:15:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:36,920 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 12 states. [2019-08-05 10:15:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,090 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-08-05 10:15:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:15:37,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:15:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,091 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:15:37,091 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:15:37,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:15:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:15:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:15:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-08-05 10:15:37,098 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 24 [2019-08-05 10:15:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,098 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-08-05 10:15:37,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:15:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-08-05 10:15:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:15:37,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,102 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 1, 1, 1] [2019-08-05 10:15:37,103 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2004511790, now seen corresponding path program 12 times [2019-08-05 10:15:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:37,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:15:37,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:15:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:15:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:37,457 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 13 states. [2019-08-05 10:15:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,509 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2019-08-05 10:15:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:15:37,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-05 10:15:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,510 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:15:37,510 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:15:37,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:15:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:15:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:15:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-08-05 10:15:37,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 26 [2019-08-05 10:15:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,516 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-08-05 10:15:37,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:15:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-08-05 10:15:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:15:37,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,517 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1] [2019-08-05 10:15:37,517 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2104551226, now seen corresponding path program 13 times [2019-08-05 10:15:37,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:37,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:15:37,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:15:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:15:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:37,693 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 14 states. [2019-08-05 10:15:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,752 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2019-08-05 10:15:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:15:37,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-05 10:15:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,754 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:15:37,754 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:15:37,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:15:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:15:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:15:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-08-05 10:15:37,759 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 28 [2019-08-05 10:15:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,759 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-08-05 10:15:37,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:15:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2019-08-05 10:15:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:15:37,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,760 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 3, 1, 1, 1] [2019-08-05 10:15:37,760 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash -455802718, now seen corresponding path program 14 times [2019-08-05 10:15:37,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:15:38,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:15:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:15:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:38,042 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 15 states. [2019-08-05 10:15:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,111 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-08-05 10:15:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:38,112 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-08-05 10:15:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,113 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:15:38,113 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:15:38,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:15:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:15:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:15:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2019-08-05 10:15:38,120 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 30 [2019-08-05 10:15:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,120 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-08-05 10:15:38,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:15:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2019-08-05 10:15:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:15:38,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,123 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 3, 1, 1, 1] [2019-08-05 10:15:38,124 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 60317706, now seen corresponding path program 15 times [2019-08-05 10:15:38,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:15:38,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:15:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:15:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:38,359 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 16 states. [2019-08-05 10:15:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,458 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-08-05 10:15:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:15:38,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-08-05 10:15:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,460 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:15:38,460 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:15:38,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:15:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:15:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:15:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2019-08-05 10:15:38,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 32 [2019-08-05 10:15:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,465 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-08-05 10:15:38,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:15:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2019-08-05 10:15:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:15:38,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,467 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 3, 1, 1, 1] [2019-08-05 10:15:38,467 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2130806130, now seen corresponding path program 16 times [2019-08-05 10:15:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:38,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:15:38,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:15:38,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:15:38,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:38,636 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 17 states. [2019-08-05 10:15:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,695 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-08-05 10:15:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:15:38,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-05 10:15:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,696 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:15:38,696 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:15:38,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:15:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:15:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:15:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-08-05 10:15:38,701 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 34 [2019-08-05 10:15:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,701 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-08-05 10:15:38,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:15:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-08-05 10:15:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:15:38,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,703 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 3, 1, 1, 1] [2019-08-05 10:15:38,703 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -994643750, now seen corresponding path program 17 times [2019-08-05 10:15:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:39,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:39,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:15:39,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:15:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:15:39,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:39,441 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 18 states. [2019-08-05 10:15:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:39,539 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2019-08-05 10:15:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:15:39,539 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-08-05 10:15:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:39,540 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:15:39,540 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:15:39,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:15:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:15:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:15:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-08-05 10:15:39,545 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 36 [2019-08-05 10:15:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:39,546 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-08-05 10:15:39,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:15:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-08-05 10:15:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:15:39,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:39,547 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 3, 1, 1, 1] [2019-08-05 10:15:39,547 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1925128770, now seen corresponding path program 18 times [2019-08-05 10:15:39,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:39,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:15:39,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:39,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:39,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:15:39,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:15:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:15:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:15:39,990 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 19 states. [2019-08-05 10:15:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,088 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-08-05 10:15:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:15:40,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-08-05 10:15:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,089 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:15:40,090 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:15:40,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:15:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:15:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:15:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:15:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-08-05 10:15:40,094 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 38 [2019-08-05 10:15:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,095 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-08-05 10:15:40,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:15:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-08-05 10:15:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:15:40,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,096 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 3, 1, 1, 1] [2019-08-05 10:15:40,096 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1082091094, now seen corresponding path program 19 times [2019-08-05 10:15:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 337 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:15:40,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:15:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:15:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:15:40,319 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 20 states. [2019-08-05 10:15:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,500 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-08-05 10:15:40,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:15:40,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-08-05 10:15:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,501 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:15:40,501 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:15:40,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:15:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:15:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:15:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:15:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2019-08-05 10:15:40,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 40 [2019-08-05 10:15:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,508 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2019-08-05 10:15:40,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:15:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2019-08-05 10:15:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:15:40,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,511 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 3, 1, 1, 1] [2019-08-05 10:15:40,511 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash -507390190, now seen corresponding path program 20 times [2019-08-05 10:15:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:15:40,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:15:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:15:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:40,801 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand 21 states. [2019-08-05 10:15:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,858 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-08-05 10:15:40,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:15:40,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-05 10:15:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,862 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:15:40,862 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:15:40,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:15:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:15:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:15:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-08-05 10:15:40,866 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 42 [2019-08-05 10:15:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,866 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-08-05 10:15:40,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:15:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-08-05 10:15:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:15:40,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,867 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 3, 1, 1, 1] [2019-08-05 10:15:40,867 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2024364666, now seen corresponding path program 21 times [2019-08-05 10:15:40,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:41,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:41,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:15:41,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:15:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:15:41,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:15:41,391 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 22 states. [2019-08-05 10:15:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,490 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2019-08-05 10:15:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:15:41,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-08-05 10:15:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,490 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:15:41,491 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:15:41,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:15:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:15:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:15:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:15:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-08-05 10:15:41,493 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 44 [2019-08-05 10:15:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,493 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-08-05 10:15:41,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:15:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-08-05 10:15:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:15:41,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,494 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 3, 1, 1, 1] [2019-08-05 10:15:41,494 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash -205675550, now seen corresponding path program 22 times [2019-08-05 10:15:41,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 457 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:41,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:41,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:15:41,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:15:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:15:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:15:41,769 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 23 states. [2019-08-05 10:15:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,867 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2019-08-05 10:15:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:15:41,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-08-05 10:15:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,868 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:15:41,868 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:15:41,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:15:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:15:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:15:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:15:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2019-08-05 10:15:41,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 46 [2019-08-05 10:15:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,873 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2019-08-05 10:15:41,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:15:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2019-08-05 10:15:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:15:41,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,874 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 3, 1, 1, 1] [2019-08-05 10:15:41,874 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -85642422, now seen corresponding path program 23 times [2019-08-05 10:15:41,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 501 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:42,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:42,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:15:42,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:15:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:15:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:15:42,264 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand 24 states. [2019-08-05 10:15:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:42,381 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2019-08-05 10:15:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:15:42,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-08-05 10:15:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:42,383 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:15:42,383 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:15:42,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:15:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:15:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:15:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:15:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-08-05 10:15:42,387 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 48 [2019-08-05 10:15:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:42,387 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-08-05 10:15:42,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:15:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-08-05 10:15:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:15:42,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:42,388 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 3, 1, 1, 1] [2019-08-05 10:15:42,389 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -697923406, now seen corresponding path program 24 times [2019-08-05 10:15:42,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:42,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:15:42,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:15:42,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:15:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:15:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:15:42,821 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 25 states. [2019-08-05 10:15:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:42,891 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2019-08-05 10:15:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:15:42,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-05 10:15:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:42,893 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:15:42,893 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:15:42,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:15:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:15:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:15:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:15:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2019-08-05 10:15:42,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 50 [2019-08-05 10:15:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:42,896 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2019-08-05 10:15:42,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:15:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2019-08-05 10:15:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:15:42,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:42,897 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 3, 1, 1, 1] [2019-08-05 10:15:42,897 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash -689429478, now seen corresponding path program 25 times [2019-08-05 10:15:42,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:42,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:15:42,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:43,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:43,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:15:43,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:15:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:15:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:15:43,236 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand 26 states. [2019-08-05 10:15:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:43,313 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-08-05 10:15:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:15:43,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-05 10:15:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:43,314 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:15:43,314 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:15:43,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:15:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:15:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:15:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:15:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2019-08-05 10:15:43,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 52 [2019-08-05 10:15:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:43,319 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-08-05 10:15:43,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:15:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2019-08-05 10:15:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:15:43,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:43,320 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 3, 1, 1, 1] [2019-08-05 10:15:43,320 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1116699262, now seen corresponding path program 26 times [2019-08-05 10:15:43,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:43,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:15:43,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 645 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:44,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:15:44,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:15:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:15:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:44,769 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand 27 states. [2019-08-05 10:15:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:44,868 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2019-08-05 10:15:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:15:44,868 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-08-05 10:15:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:44,869 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:15:44,869 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:15:44,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:15:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:15:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:15:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2019-08-05 10:15:44,873 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 54 [2019-08-05 10:15:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:44,873 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2019-08-05 10:15:44,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:15:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2019-08-05 10:15:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:15:44,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:44,874 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 3, 1, 1, 1] [2019-08-05 10:15:44,874 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 593898730, now seen corresponding path program 27 times [2019-08-05 10:15:44,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:44,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:15:44,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:45,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:45,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:15:45,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:15:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:15:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:45,364 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand 28 states. [2019-08-05 10:15:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:45,446 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2019-08-05 10:15:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:15:45,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-08-05 10:15:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:45,447 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:15:45,447 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:15:45,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:15:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:15:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:15:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2019-08-05 10:15:45,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 56 [2019-08-05 10:15:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:45,452 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2019-08-05 10:15:45,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:15:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2019-08-05 10:15:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:15:45,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:45,453 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 3, 1, 1, 1] [2019-08-05 10:15:45,453 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -493905326, now seen corresponding path program 28 times [2019-08-05 10:15:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:15:45,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:46,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:15:46,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:15:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:15:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:46,129 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand 29 states. [2019-08-05 10:15:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:46,310 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2019-08-05 10:15:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:15:46,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-05 10:15:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:46,311 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:15:46,311 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:15:46,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:15:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:15:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:15:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-08-05 10:15:46,315 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 58 [2019-08-05 10:15:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:46,316 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-08-05 10:15:46,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:15:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-08-05 10:15:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:15:46,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:46,317 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 3, 1, 1, 1] [2019-08-05 10:15:46,317 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2098417082, now seen corresponding path program 29 times [2019-08-05 10:15:46,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 807 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:46,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:46,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:15:46,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:15:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:15:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:46,700 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 30 states. [2019-08-05 10:15:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:46,789 INFO L93 Difference]: Finished difference Result 63 states and 91 transitions. [2019-08-05 10:15:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:15:46,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-08-05 10:15:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:46,790 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:15:46,790 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:15:46,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:15:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:15:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:15:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2019-08-05 10:15:46,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 60 [2019-08-05 10:15:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:46,794 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2019-08-05 10:15:46,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:15:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2019-08-05 10:15:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:15:46,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:46,795 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 3, 1, 1, 1] [2019-08-05 10:15:46,796 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2055747806, now seen corresponding path program 30 times [2019-08-05 10:15:46,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 865 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:47,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:15:47,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:15:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:15:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:47,194 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand 31 states. [2019-08-05 10:15:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:47,307 INFO L93 Difference]: Finished difference Result 65 states and 94 transitions. [2019-08-05 10:15:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:15:47,307 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-08-05 10:15:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:47,308 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:15:47,308 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:15:47,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:15:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:15:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:15:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2019-08-05 10:15:47,312 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 62 [2019-08-05 10:15:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:47,313 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2019-08-05 10:15:47,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:15:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2019-08-05 10:15:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:15:47,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:47,314 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 3, 1, 1, 1] [2019-08-05 10:15:47,314 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash 111380106, now seen corresponding path program 31 times [2019-08-05 10:15:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:47,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:15:47,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:47,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:15:47,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:15:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:15:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:47,709 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand 32 states. [2019-08-05 10:15:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:47,832 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2019-08-05 10:15:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:15:47,832 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-08-05 10:15:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:47,833 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:15:47,833 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:15:47,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:15:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:15:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:15:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2019-08-05 10:15:47,837 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 64 [2019-08-05 10:15:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:47,838 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2019-08-05 10:15:47,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:15:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2019-08-05 10:15:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:15:47,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:47,839 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 3, 1, 1, 1] [2019-08-05 10:15:47,839 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash -337835022, now seen corresponding path program 32 times [2019-08-05 10:15:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:47,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:15:47,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 0 proven. 987 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:15:48,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:15:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:15:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:48,312 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand 33 states. [2019-08-05 10:15:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:48,486 INFO L93 Difference]: Finished difference Result 69 states and 100 transitions. [2019-08-05 10:15:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:15:48,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-05 10:15:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:48,488 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:15:48,490 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:15:48,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:15:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:15:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:15:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2019-08-05 10:15:48,493 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 66 [2019-08-05 10:15:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:48,493 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2019-08-05 10:15:48,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:15:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2019-08-05 10:15:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:15:48,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:48,494 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 3, 1, 1, 1] [2019-08-05 10:15:48,495 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1758123866, now seen corresponding path program 33 times [2019-08-05 10:15:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:15:48,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 1051 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:49,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:49,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:15:49,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:15:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:15:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:49,269 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand 34 states. [2019-08-05 10:15:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:49,396 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-08-05 10:15:49,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:15:49,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-08-05 10:15:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:49,397 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:15:49,398 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:15:49,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:15:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:15:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:15:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2019-08-05 10:15:49,400 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 68 [2019-08-05 10:15:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:49,401 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2019-08-05 10:15:49,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:15:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2019-08-05 10:15:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:15:49,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:49,401 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 3, 1, 1, 1] [2019-08-05 10:15:49,402 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1634953410, now seen corresponding path program 34 times [2019-08-05 10:15:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:49,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:15:49,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 0 proven. 1117 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:49,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:49,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:15:49,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:15:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:15:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:15:49,989 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand 35 states. [2019-08-05 10:15:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,096 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2019-08-05 10:15:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:15:50,097 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-08-05 10:15:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,098 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:15:50,098 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:15:50,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:15:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:15:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:15:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:15:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2019-08-05 10:15:50,101 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 70 [2019-08-05 10:15:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,102 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2019-08-05 10:15:50,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:15:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2019-08-05 10:15:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:15:50,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,103 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 3, 1, 1, 1] [2019-08-05 10:15:50,103 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -767737814, now seen corresponding path program 35 times [2019-08-05 10:15:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:15:50,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:15:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:15:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:50,638 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand 36 states. [2019-08-05 10:15:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,778 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2019-08-05 10:15:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:15:50,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-08-05 10:15:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,780 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:15:50,780 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:15:50,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:15:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:15:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:15:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2019-08-05 10:15:50,783 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 72 [2019-08-05 10:15:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,784 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2019-08-05 10:15:50,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:15:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2019-08-05 10:15:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:15:50,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,785 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 3, 1, 1, 1] [2019-08-05 10:15:50,785 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash 938401170, now seen corresponding path program 36 times [2019-08-05 10:15:50,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1255 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:15:51,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:15:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:15:51,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:51,374 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand 37 states. [2019-08-05 10:15:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:51,500 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-08-05 10:15:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:15:51,500 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-05 10:15:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:51,502 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:15:51,502 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:15:51,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:15:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:15:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:15:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-08-05 10:15:51,506 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 74 [2019-08-05 10:15:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:51,506 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-08-05 10:15:51,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:15:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-08-05 10:15:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:15:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:51,507 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 3, 1, 1, 1] [2019-08-05 10:15:51,507 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -139542278, now seen corresponding path program 37 times [2019-08-05 10:15:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:51,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:15:51,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:53,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:53,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:15:53,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:15:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:15:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:15:53,160 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 38 states. [2019-08-05 10:15:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:53,278 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2019-08-05 10:15:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:15:53,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-08-05 10:15:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:53,280 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:15:53,280 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:15:53,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:15:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:15:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:15:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:15:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2019-08-05 10:15:53,284 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 76 [2019-08-05 10:15:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:53,284 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2019-08-05 10:15:53,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:15:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2019-08-05 10:15:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:15:53,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:53,285 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 3, 1, 1, 1] [2019-08-05 10:15:53,285 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -956077470, now seen corresponding path program 38 times [2019-08-05 10:15:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:53,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:15:53,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 1401 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:54,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:54,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:15:54,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:15:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:15:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:15:54,036 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand 39 states. [2019-08-05 10:15:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:54,189 INFO L93 Difference]: Finished difference Result 81 states and 118 transitions. [2019-08-05 10:15:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:15:54,190 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-08-05 10:15:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:54,191 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:15:54,191 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:15:54,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:15:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:15:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:15:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:15:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2019-08-05 10:15:54,194 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 78 [2019-08-05 10:15:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:54,195 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2019-08-05 10:15:54,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:15:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2019-08-05 10:15:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:15:54,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:54,195 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 3, 1, 1, 1] [2019-08-05 10:15:54,196 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash 332618186, now seen corresponding path program 39 times [2019-08-05 10:15:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:54,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:15:54,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 0 proven. 1477 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:15:55,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:15:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:15:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:15:55,001 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand 40 states. [2019-08-05 10:15:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:55,124 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2019-08-05 10:15:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:15:55,125 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-08-05 10:15:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:55,126 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:15:55,126 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:15:55,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:15:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:15:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:15:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:15:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2019-08-05 10:15:55,129 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 80 [2019-08-05 10:15:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:55,129 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2019-08-05 10:15:55,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:15:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2019-08-05 10:15:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:15:55,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:55,130 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 3, 1, 1, 1] [2019-08-05 10:15:55,130 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1818562354, now seen corresponding path program 40 times [2019-08-05 10:15:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:55,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:15:55,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 0 proven. 1555 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:55,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:15:55,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:15:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:15:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:15:55,917 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand 41 states. [2019-08-05 10:15:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:56,047 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2019-08-05 10:15:56,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:15:56,048 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-05 10:15:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:56,049 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:15:56,049 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:15:56,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:15:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:15:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:15:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:15:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2019-08-05 10:15:56,052 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 82 [2019-08-05 10:15:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:56,052 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2019-08-05 10:15:56,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:15:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2019-08-05 10:15:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:15:56,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:56,053 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 3, 1, 1, 1] [2019-08-05 10:15:56,053 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -413201766, now seen corresponding path program 41 times [2019-08-05 10:15:56,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:56,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:15:56,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 0 proven. 1635 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:15:56,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:15:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:15:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:15:56,687 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand 42 states. [2019-08-05 10:15:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:56,887 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2019-08-05 10:15:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:15:56,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2019-08-05 10:15:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:56,888 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:15:56,888 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:15:56,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:15:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:15:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:15:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:15:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2019-08-05 10:15:56,892 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 84 [2019-08-05 10:15:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:56,892 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2019-08-05 10:15:56,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:15:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2019-08-05 10:15:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:15:56,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:56,893 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 3, 1, 1, 1] [2019-08-05 10:15:56,893 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1949840382, now seen corresponding path program 42 times [2019-08-05 10:15:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:56,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:15:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1723 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:57,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:57,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:15:57,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:15:57,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:15:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:15:57,645 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand 43 states. [2019-08-05 10:15:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:57,775 INFO L93 Difference]: Finished difference Result 89 states and 130 transitions. [2019-08-05 10:15:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:15:57,775 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-08-05 10:15:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:57,776 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:15:57,777 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:15:57,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:15:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:15:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:15:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:15:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2019-08-05 10:15:57,780 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 86 [2019-08-05 10:15:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:57,780 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2019-08-05 10:15:57,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:15:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2019-08-05 10:15:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:15:57,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:57,781 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 3, 1, 1, 1] [2019-08-05 10:15:57,781 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:57,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1190800534, now seen corresponding path program 43 times [2019-08-05 10:15:57,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:57,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:15:57,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 0 proven. 1801 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:58,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:15:58,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:15:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:15:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:15:58,482 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand 44 states. [2019-08-05 10:15:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:58,725 INFO L93 Difference]: Finished difference Result 91 states and 133 transitions. [2019-08-05 10:15:58,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:15:58,726 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-08-05 10:15:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:58,727 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:15:58,727 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:15:58,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:15:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:15:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:15:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:15:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2019-08-05 10:15:58,730 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 88 [2019-08-05 10:15:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:58,730 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2019-08-05 10:15:58,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:15:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2019-08-05 10:15:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:15:58,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:58,731 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 3, 1, 1, 1] [2019-08-05 10:15:58,731 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:58,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1897946926, now seen corresponding path program 44 times [2019-08-05 10:15:58,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:58,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:15:58,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 0 proven. 1887 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:15:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:59,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:15:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:15:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:15:59,738 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 45 states. [2019-08-05 10:15:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:59,902 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2019-08-05 10:15:59,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:15:59,902 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-05 10:15:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:59,903 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:15:59,904 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:15:59,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:15:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:15:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:15:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:15:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2019-08-05 10:15:59,907 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 90 [2019-08-05 10:15:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:59,907 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2019-08-05 10:15:59,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:15:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2019-08-05 10:15:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:15:59,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:59,908 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 3, 1, 1, 1] [2019-08-05 10:15:59,909 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1434170426, now seen corresponding path program 45 times [2019-08-05 10:15:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:59,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:15:59,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1975 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:00,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:00,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:16:00,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:16:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:16:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:16:00,658 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand 46 states. [2019-08-05 10:16:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:00,840 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2019-08-05 10:16:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:16:00,840 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2019-08-05 10:16:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:00,842 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:16:00,842 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:16:00,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:16:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:16:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:16:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:16:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2019-08-05 10:16:00,845 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 92 [2019-08-05 10:16:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:00,846 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2019-08-05 10:16:00,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:16:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2019-08-05 10:16:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:16:00,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:00,847 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 3, 1, 1, 1] [2019-08-05 10:16:00,847 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -446657118, now seen corresponding path program 46 times [2019-08-05 10:16:00,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:00,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:16:00,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2071 backedges. 0 proven. 2065 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:01,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:01,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:16:01,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:16:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:16:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:16:01,976 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand 47 states. [2019-08-05 10:16:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:02,457 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2019-08-05 10:16:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:16:02,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-08-05 10:16:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:02,459 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:16:02,459 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:16:02,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:16:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:16:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:16:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:16:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2019-08-05 10:16:02,463 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 94 [2019-08-05 10:16:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:02,464 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2019-08-05 10:16:02,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:16:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2019-08-05 10:16:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:16:02,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:02,465 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 3, 1, 1, 1] [2019-08-05 10:16:02,465 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 259304714, now seen corresponding path program 47 times [2019-08-05 10:16:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:02,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:16:02,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 0 proven. 2157 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:04,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:04,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:16:04,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:16:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:16:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:16:04,324 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand 48 states. [2019-08-05 10:16:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:04,698 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2019-08-05 10:16:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:16:04,698 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-08-05 10:16:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:04,699 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:16:04,699 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:16:04,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:16:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:16:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:16:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:16:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2019-08-05 10:16:04,702 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 96 [2019-08-05 10:16:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:04,703 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2019-08-05 10:16:04,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:16:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2019-08-05 10:16:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:16:04,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:04,704 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 3, 1, 1, 1] [2019-08-05 10:16:04,704 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 83792498, now seen corresponding path program 48 times [2019-08-05 10:16:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:04,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:16:04,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 2251 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:05,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:05,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:16:05,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:16:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:16:05,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:16:05,607 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand 49 states. [2019-08-05 10:16:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:05,761 INFO L93 Difference]: Finished difference Result 101 states and 148 transitions. [2019-08-05 10:16:05,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:16:05,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-05 10:16:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:05,763 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:16:05,763 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:16:05,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:16:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:16:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:16:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:16:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2019-08-05 10:16:05,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 98 [2019-08-05 10:16:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:05,766 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2019-08-05 10:16:05,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:16:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2019-08-05 10:16:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:16:05,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:05,767 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 3, 1, 1, 1] [2019-08-05 10:16:05,767 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1079722534, now seen corresponding path program 49 times [2019-08-05 10:16:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:05,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:16:05,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2347 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:06,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:06,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:16:06,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:16:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:16:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:16:06,783 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand 50 states. [2019-08-05 10:16:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:06,944 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2019-08-05 10:16:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:16:06,945 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-08-05 10:16:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:06,946 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:16:06,947 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:16:06,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:16:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:16:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:16:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:16:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2019-08-05 10:16:06,949 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 100 [2019-08-05 10:16:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:06,950 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2019-08-05 10:16:06,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:16:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2019-08-05 10:16:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:16:06,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:06,951 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 3, 1, 1, 1] [2019-08-05 10:16:06,951 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1768795970, now seen corresponding path program 50 times [2019-08-05 10:16:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:06,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:16:06,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 2445 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:07,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:07,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:16:07,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:16:07,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:16:07,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:16:07,849 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand 51 states. [2019-08-05 10:16:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:08,037 INFO L93 Difference]: Finished difference Result 105 states and 154 transitions. [2019-08-05 10:16:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:16:08,038 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2019-08-05 10:16:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:08,039 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:16:08,039 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:16:08,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:16:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:16:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:16:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:16:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2019-08-05 10:16:08,043 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 102 [2019-08-05 10:16:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:08,043 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2019-08-05 10:16:08,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:16:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2019-08-05 10:16:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:16:08,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:08,044 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 3, 1, 1, 1] [2019-08-05 10:16:08,044 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -994056534, now seen corresponding path program 51 times [2019-08-05 10:16:08,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:08,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:16:08,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 0 proven. 2545 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:09,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:16:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:16:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:09,182 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 52 states. [2019-08-05 10:16:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:09,356 INFO L93 Difference]: Finished difference Result 107 states and 157 transitions. [2019-08-05 10:16:09,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:16:09,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-08-05 10:16:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:09,358 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:16:09,358 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:16:09,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:16:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:16:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:16:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2019-08-05 10:16:09,362 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 104 [2019-08-05 10:16:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:09,362 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2019-08-05 10:16:09,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:16:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2019-08-05 10:16:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:16:09,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:09,363 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 3, 1, 1, 1] [2019-08-05 10:16:09,363 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1805523950, now seen corresponding path program 52 times [2019-08-05 10:16:09,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:09,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:16:09,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 0 proven. 2647 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:10,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:10,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:16:10,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:10,552 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand 53 states. [2019-08-05 10:16:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:10,732 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-08-05 10:16:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:16:10,733 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-05 10:16:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:10,734 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:16:10,734 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:16:10,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:16:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:16:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:16:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2019-08-05 10:16:10,738 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 106 [2019-08-05 10:16:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:10,739 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2019-08-05 10:16:10,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2019-08-05 10:16:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:16:10,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:10,740 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 3, 1, 1, 1] [2019-08-05 10:16:10,740 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash 58337146, now seen corresponding path program 53 times [2019-08-05 10:16:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:16:10,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 0 proven. 2751 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:12,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:16:12,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:16:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:16:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:12,357 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand 54 states. [2019-08-05 10:16:12,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:12,582 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2019-08-05 10:16:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:16:12,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2019-08-05 10:16:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,584 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:16:12,584 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:16:12,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:16:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:16:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:16:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2019-08-05 10:16:12,588 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2019-08-05 10:16:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:12,588 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2019-08-05 10:16:12,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:16:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2019-08-05 10:16:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:16:12,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:12,589 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 3, 1, 1, 1] [2019-08-05 10:16:12,589 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash 227487970, now seen corresponding path program 54 times [2019-08-05 10:16:12,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:12,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:16:12,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2863 backedges. 0 proven. 2857 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:13,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:16:13,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:16:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:16:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:13,847 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand 55 states. [2019-08-05 10:16:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:14,048 INFO L93 Difference]: Finished difference Result 113 states and 166 transitions. [2019-08-05 10:16:14,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:16:14,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2019-08-05 10:16:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:14,049 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:16:14,049 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:16:14,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:16:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:16:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:16:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2019-08-05 10:16:14,052 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 110 [2019-08-05 10:16:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:14,053 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2019-08-05 10:16:14,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:16:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2019-08-05 10:16:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:16:14,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:14,054 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 3, 1, 1, 1] [2019-08-05 10:16:14,054 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash -427327414, now seen corresponding path program 55 times [2019-08-05 10:16:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:16:14,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 0 proven. 2965 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:15,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:15,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:16:15,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:16:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:16:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:15,544 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand 56 states. [2019-08-05 10:16:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:15,853 INFO L93 Difference]: Finished difference Result 115 states and 169 transitions. [2019-08-05 10:16:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:16:15,854 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-08-05 10:16:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:15,855 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:16:15,855 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:16:15,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:16:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:16:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:16:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-08-05 10:16:15,858 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 112 [2019-08-05 10:16:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:15,859 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-08-05 10:16:15,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:16:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-08-05 10:16:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:16:15,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:15,860 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 3, 1, 1, 1] [2019-08-05 10:16:15,860 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1655281074, now seen corresponding path program 56 times [2019-08-05 10:16:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:15,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:16:15,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3075 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:17,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:16:17,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:16:17,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:16:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:17,131 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 57 states. [2019-08-05 10:16:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:17,343 INFO L93 Difference]: Finished difference Result 117 states and 172 transitions. [2019-08-05 10:16:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:16:17,344 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2019-08-05 10:16:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:17,345 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:16:17,345 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:16:17,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:16:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:16:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:16:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2019-08-05 10:16:17,350 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 114 [2019-08-05 10:16:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:17,350 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2019-08-05 10:16:17,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:16:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2019-08-05 10:16:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:16:17,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:17,351 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 3, 1, 1, 1] [2019-08-05 10:16:17,352 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1587278106, now seen corresponding path program 57 times [2019-08-05 10:16:17,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:17,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:16:17,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 0 proven. 3187 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:16:18,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:16:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:16:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:18,583 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 58 states. [2019-08-05 10:16:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:18,793 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2019-08-05 10:16:18,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:16:18,794 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 116 [2019-08-05 10:16:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:18,795 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:16:18,795 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:16:18,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:16:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:16:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:16:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2019-08-05 10:16:18,798 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 116 [2019-08-05 10:16:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:18,799 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2019-08-05 10:16:18,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:16:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2019-08-05 10:16:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:16:18,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,800 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 3, 1, 1, 1] [2019-08-05 10:16:18,800 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash 660935298, now seen corresponding path program 58 times [2019-08-05 10:16:18,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3307 backedges. 0 proven. 3301 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:20,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:20,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:16:20,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:16:20,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:16:20,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:16:20,324 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand 59 states. [2019-08-05 10:16:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:20,534 INFO L93 Difference]: Finished difference Result 121 states and 178 transitions. [2019-08-05 10:16:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:16:20,535 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 118 [2019-08-05 10:16:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:20,536 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:16:20,536 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:16:20,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:16:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:16:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:16:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:16:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2019-08-05 10:16:20,540 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 118 [2019-08-05 10:16:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:20,540 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2019-08-05 10:16:20,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:16:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2019-08-05 10:16:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:16:20,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:20,541 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 3, 1, 1, 1] [2019-08-05 10:16:20,542 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash -496272918, now seen corresponding path program 59 times [2019-08-05 10:16:20,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:20,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:16:20,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 0 proven. 3417 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:21,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:21,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:16:21,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:16:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:16:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:16:21,833 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand 60 states. [2019-08-05 10:16:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:22,056 INFO L93 Difference]: Finished difference Result 123 states and 181 transitions. [2019-08-05 10:16:22,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:16:22,056 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-08-05 10:16:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:22,057 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:16:22,057 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:16:22,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:16:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:16:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:16:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:16:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2019-08-05 10:16:22,061 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 120 [2019-08-05 10:16:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:22,062 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-08-05 10:16:22,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:16:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2019-08-05 10:16:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:16:22,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:22,063 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 3, 1, 1, 1] [2019-08-05 10:16:22,063 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -176838830, now seen corresponding path program 60 times [2019-08-05 10:16:22,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:22,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:16:22,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3541 backedges. 0 proven. 3535 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:16:23,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:16:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:16:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:16:23,749 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand 61 states. [2019-08-05 10:16:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:23,984 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2019-08-05 10:16:23,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:16:23,985 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2019-08-05 10:16:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:23,986 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:16:23,986 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:16:23,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:16:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:16:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:16:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:16:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 184 transitions. [2019-08-05 10:16:23,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 184 transitions. Word has length 122 [2019-08-05 10:16:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:23,989 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 184 transitions. [2019-08-05 10:16:23,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:16:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 184 transitions. [2019-08-05 10:16:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:16:23,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:23,990 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 3, 1, 1, 1] [2019-08-05 10:16:23,990 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1856641722, now seen corresponding path program 61 times [2019-08-05 10:16:23,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:24,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:16:24,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:25,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:25,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:16:25,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:16:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:16:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:16:25,667 INFO L87 Difference]: Start difference. First operand 125 states and 184 transitions. Second operand 62 states. [2019-08-05 10:16:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:25,935 INFO L93 Difference]: Finished difference Result 127 states and 187 transitions. [2019-08-05 10:16:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:16:25,935 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 124 [2019-08-05 10:16:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:25,936 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:16:25,937 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:16:25,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:16:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:16:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:16:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:16:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2019-08-05 10:16:25,940 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 124 [2019-08-05 10:16:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:25,941 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2019-08-05 10:16:25,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:16:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2019-08-05 10:16:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:16:25,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:25,942 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 3, 1, 1, 1] [2019-08-05 10:16:25,942 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1821332514, now seen corresponding path program 62 times [2019-08-05 10:16:25,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:25,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:16:25,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3777 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:27,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:27,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:16:27,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:16:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:16:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:27,339 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand 63 states. [2019-08-05 10:16:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:27,614 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2019-08-05 10:16:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:16:27,616 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2019-08-05 10:16:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:27,617 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:16:27,617 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:16:27,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:16:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:16:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:16:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2019-08-05 10:16:27,621 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 126 [2019-08-05 10:16:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:27,622 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2019-08-05 10:16:27,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:16:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2019-08-05 10:16:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:16:27,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:27,623 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 3, 1, 1, 1] [2019-08-05 10:16:27,623 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2046045302, now seen corresponding path program 63 times [2019-08-05 10:16:27,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:16:27,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 0 proven. 3901 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:29,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:29,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:16:29,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:16:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:16:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:29,037 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand 64 states. [2019-08-05 10:16:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:29,316 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2019-08-05 10:16:29,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:16:29,316 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-08-05 10:16:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:29,317 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:16:29,317 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:16:29,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:16:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:16:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:16:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2019-08-05 10:16:29,321 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 128 [2019-08-05 10:16:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:29,321 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2019-08-05 10:16:29,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:16:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2019-08-05 10:16:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:16:29,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:29,323 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 3, 1, 1, 1] [2019-08-05 10:16:29,323 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 845551858, now seen corresponding path program 64 times [2019-08-05 10:16:29,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:29,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:16:29,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4033 backedges. 0 proven. 4027 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:31,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:31,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:16:31,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:16:31,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:16:31,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:16:31,107 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 65 states. [2019-08-05 10:16:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:31,380 INFO L93 Difference]: Finished difference Result 133 states and 196 transitions. [2019-08-05 10:16:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:16:31,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2019-08-05 10:16:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:31,382 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:16:31,382 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:16:31,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:16:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:16:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:16:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:16:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2019-08-05 10:16:31,385 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 130 [2019-08-05 10:16:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:31,385 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2019-08-05 10:16:31,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:16:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2019-08-05 10:16:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:16:31,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:31,386 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 3, 1, 1, 1] [2019-08-05 10:16:31,386 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 826582106, now seen corresponding path program 65 times [2019-08-05 10:16:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:31,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:16:31,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 0 proven. 4155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:33,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:33,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:16:33,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:16:33,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:16:33,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:16:33,446 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand 66 states. [2019-08-05 10:16:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,715 INFO L93 Difference]: Finished difference Result 135 states and 199 transitions. [2019-08-05 10:16:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:16:33,716 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 132 [2019-08-05 10:16:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,717 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:16:33,717 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:16:33,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:16:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:16:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:16:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:16:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2019-08-05 10:16:33,720 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 132 [2019-08-05 10:16:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,721 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-08-05 10:16:33,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:16:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2019-08-05 10:16:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:16:33,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,722 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 3, 1, 1, 1] [2019-08-05 10:16:33,722 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash -223480382, now seen corresponding path program 66 times [2019-08-05 10:16:33,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4291 backedges. 0 proven. 4285 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:36,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:16:36,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:16:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:16:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:16:36,793 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand 67 states. [2019-08-05 10:16:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,159 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2019-08-05 10:16:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:16:37,160 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 134 [2019-08-05 10:16:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,161 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:16:37,161 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:16:37,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:16:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:16:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:16:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:16:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 202 transitions. [2019-08-05 10:16:37,164 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 202 transitions. Word has length 134 [2019-08-05 10:16:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,164 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 202 transitions. [2019-08-05 10:16:37,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:16:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 202 transitions. [2019-08-05 10:16:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:16:37,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,166 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 3, 1, 1, 1] [2019-08-05 10:16:37,166 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -16216790, now seen corresponding path program 67 times [2019-08-05 10:16:37,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 0 proven. 4417 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:38,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:38,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:16:38,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:16:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:16:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:16:38,860 INFO L87 Difference]: Start difference. First operand 137 states and 202 transitions. Second operand 68 states. [2019-08-05 10:16:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,154 INFO L93 Difference]: Finished difference Result 139 states and 205 transitions. [2019-08-05 10:16:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:16:39,154 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-08-05 10:16:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,155 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:16:39,156 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:16:39,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:16:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:16:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:16:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:16:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2019-08-05 10:16:39,158 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 136 [2019-08-05 10:16:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,159 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2019-08-05 10:16:39,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:16:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2019-08-05 10:16:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:16:39,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:39,159 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 3, 1, 1, 1] [2019-08-05 10:16:39,160 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1595599506, now seen corresponding path program 68 times [2019-08-05 10:16:39,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:39,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:16:39,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4557 backedges. 0 proven. 4551 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:41,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:41,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:16:41,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:16:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:16:41,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:16:41,077 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand 69 states. [2019-08-05 10:16:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:41,474 INFO L93 Difference]: Finished difference Result 141 states and 208 transitions. [2019-08-05 10:16:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:16:41,474 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2019-08-05 10:16:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:41,475 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:16:41,475 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:16:41,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:16:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:16:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:16:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:16:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-08-05 10:16:41,478 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 138 [2019-08-05 10:16:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:41,478 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-08-05 10:16:41,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:16:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-08-05 10:16:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:16:41,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:41,479 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 3, 1, 1, 1] [2019-08-05 10:16:41,479 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 67866106, now seen corresponding path program 69 times [2019-08-05 10:16:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:41,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:16:41,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:43,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:43,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:16:43,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:16:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:16:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:16:43,420 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 70 states. [2019-08-05 10:16:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:44,351 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2019-08-05 10:16:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:16:44,351 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 140 [2019-08-05 10:16:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:44,352 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:16:44,352 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:16:44,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:16:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:16:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:16:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:16:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 211 transitions. [2019-08-05 10:16:44,354 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 211 transitions. Word has length 140 [2019-08-05 10:16:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:44,354 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 211 transitions. [2019-08-05 10:16:44,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:16:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2019-08-05 10:16:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:16:44,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:44,355 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 3, 1, 1, 1] [2019-08-05 10:16:44,355 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash 794883938, now seen corresponding path program 70 times [2019-08-05 10:16:44,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4831 backedges. 0 proven. 4825 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:46,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:16:46,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:16:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:16:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:16:46,371 INFO L87 Difference]: Start difference. First operand 143 states and 211 transitions. Second operand 71 states. [2019-08-05 10:16:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,701 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2019-08-05 10:16:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:16:46,702 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2019-08-05 10:16:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,703 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:16:46,703 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:16:46,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:16:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:16:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:16:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:16:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 214 transitions. [2019-08-05 10:16:46,707 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 214 transitions. Word has length 142 [2019-08-05 10:16:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,707 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 214 transitions. [2019-08-05 10:16:46,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:16:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 214 transitions. [2019-08-05 10:16:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:16:46,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,709 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 3, 1, 1, 1] [2019-08-05 10:16:46,709 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash -620648758, now seen corresponding path program 71 times [2019-08-05 10:16:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 0 proven. 4965 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:48,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:16:48,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:16:48,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:16:48,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:16:48,505 INFO L87 Difference]: Start difference. First operand 145 states and 214 transitions. Second operand 72 states. [2019-08-05 10:16:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,843 INFO L93 Difference]: Finished difference Result 147 states and 217 transitions. [2019-08-05 10:16:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:16:48,844 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-08-05 10:16:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,845 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:16:48,845 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:16:48,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:16:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:16:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:16:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:16:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2019-08-05 10:16:48,849 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 144 [2019-08-05 10:16:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,850 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2019-08-05 10:16:48,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:16:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2019-08-05 10:16:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:16:48,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,850 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 3, 1, 1, 1] [2019-08-05 10:16:48,851 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash 557063218, now seen corresponding path program 72 times [2019-08-05 10:16:48,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5113 backedges. 0 proven. 5107 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:51,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:16:51,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:16:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:16:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:16:51,094 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand 73 states. [2019-08-05 10:16:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,431 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-08-05 10:16:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:16:51,431 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2019-08-05 10:16:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,433 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:16:51,433 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:16:51,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:16:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:16:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:16:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:16:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 220 transitions. [2019-08-05 10:16:51,436 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 220 transitions. Word has length 146 [2019-08-05 10:16:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,437 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 220 transitions. [2019-08-05 10:16:51,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:16:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 220 transitions. [2019-08-05 10:16:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:16:51,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,438 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 3, 1, 1, 1] [2019-08-05 10:16:51,438 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1533093990, now seen corresponding path program 73 times [2019-08-05 10:16:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:53,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:53,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:16:53,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:16:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:16:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:16:53,528 INFO L87 Difference]: Start difference. First operand 149 states and 220 transitions. Second operand 74 states. [2019-08-05 10:16:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:53,891 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2019-08-05 10:16:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:16:53,892 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 148 [2019-08-05 10:16:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:53,893 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:16:53,893 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:16:53,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:16:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:16:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:16:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:16:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 223 transitions. [2019-08-05 10:16:53,896 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 223 transitions. Word has length 148 [2019-08-05 10:16:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:53,897 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 223 transitions. [2019-08-05 10:16:53,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:16:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 223 transitions. [2019-08-05 10:16:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:16:53,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:53,898 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 3, 1, 1, 1] [2019-08-05 10:16:53,898 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -129476350, now seen corresponding path program 74 times [2019-08-05 10:16:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:53,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:16:53,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5403 backedges. 0 proven. 5397 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:56,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:16:56,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:16:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:16:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:16:56,251 INFO L87 Difference]: Start difference. First operand 151 states and 223 transitions. Second operand 75 states. [2019-08-05 10:16:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:56,603 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2019-08-05 10:16:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:16:56,603 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 150 [2019-08-05 10:16:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:56,604 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:16:56,604 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:16:56,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:16:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:16:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-05 10:16:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:16:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 226 transitions. [2019-08-05 10:16:56,607 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 226 transitions. Word has length 150 [2019-08-05 10:16:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:56,607 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 226 transitions. [2019-08-05 10:16:56,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:16:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 226 transitions. [2019-08-05 10:16:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:16:56,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:56,608 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 3, 1, 1, 1] [2019-08-05 10:16:56,608 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 127344746, now seen corresponding path program 75 times [2019-08-05 10:16:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:56,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:16:56,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:16:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:58,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:16:58,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:16:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:16:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:16:58,563 INFO L87 Difference]: Start difference. First operand 153 states and 226 transitions. Second operand 76 states. [2019-08-05 10:16:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,933 INFO L93 Difference]: Finished difference Result 155 states and 229 transitions. [2019-08-05 10:16:58,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:16:58,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-08-05 10:16:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,934 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:16:58,934 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:16:58,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:16:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:16:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:16:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:16:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2019-08-05 10:16:58,936 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 152 [2019-08-05 10:16:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,937 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2019-08-05 10:16:58,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:16:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2019-08-05 10:16:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:16:58,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,938 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 3, 1, 1, 1] [2019-08-05 10:16:58,938 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2119282130, now seen corresponding path program 76 times [2019-08-05 10:16:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5701 backedges. 0 proven. 5695 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:01,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:01,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:17:01,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:17:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:17:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:17:01,140 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand 77 states. [2019-08-05 10:17:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:01,511 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2019-08-05 10:17:01,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:17:01,512 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2019-08-05 10:17:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:01,513 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:17:01,513 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:17:01,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:17:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:17:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:17:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:17:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-08-05 10:17:01,517 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 154 [2019-08-05 10:17:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:01,517 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-08-05 10:17:01,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:17:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-08-05 10:17:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:17:01,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:01,518 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 3, 1, 1, 1] [2019-08-05 10:17:01,518 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 815694138, now seen corresponding path program 77 times [2019-08-05 10:17:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:01,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:17:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 0 proven. 5847 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:17:03,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:17:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:17:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:17:03,670 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 78 states. [2019-08-05 10:17:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,055 INFO L93 Difference]: Finished difference Result 159 states and 235 transitions. [2019-08-05 10:17:04,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:17:04,056 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 156 [2019-08-05 10:17:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,057 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:17:04,057 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:17:04,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:17:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:17:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 10:17:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:17:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 235 transitions. [2019-08-05 10:17:04,061 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 235 transitions. Word has length 156 [2019-08-05 10:17:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,061 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 235 transitions. [2019-08-05 10:17:04,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:17:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 235 transitions. [2019-08-05 10:17:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:17:04,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,062 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 3, 1, 1, 1] [2019-08-05 10:17:04,062 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2096883038, now seen corresponding path program 78 times [2019-08-05 10:17:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 0 proven. 6001 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:17:06,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:17:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:17:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:17:06,269 INFO L87 Difference]: Start difference. First operand 159 states and 235 transitions. Second operand 79 states. [2019-08-05 10:17:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,677 INFO L93 Difference]: Finished difference Result 161 states and 238 transitions. [2019-08-05 10:17:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:17:06,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2019-08-05 10:17:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,678 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:17:06,679 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:17:06,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:17:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:17:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-05 10:17:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:17:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2019-08-05 10:17:06,681 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 158 [2019-08-05 10:17:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,681 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2019-08-05 10:17:06,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:17:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2019-08-05 10:17:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:17:06,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,682 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 3, 1, 1, 1] [2019-08-05 10:17:06,682 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash -764872182, now seen corresponding path program 79 times [2019-08-05 10:17:06,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 0 proven. 6157 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:08,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:17:08,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:17:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:17:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:17:08,853 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand 80 states. [2019-08-05 10:17:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,258 INFO L93 Difference]: Finished difference Result 163 states and 241 transitions. [2019-08-05 10:17:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:17:09,259 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-08-05 10:17:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,260 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:17:09,260 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:17:09,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:17:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:17:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:17:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:17:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-08-05 10:17:09,264 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 160 [2019-08-05 10:17:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,264 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-08-05 10:17:09,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:17:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-08-05 10:17:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:17:09,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,265 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 3, 1, 1, 1] [2019-08-05 10:17:09,265 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -602693774, now seen corresponding path program 80 times [2019-08-05 10:17:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6321 backedges. 0 proven. 6315 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:17:11,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:17:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:17:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:17:11,886 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 81 states. [2019-08-05 10:17:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:12,313 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2019-08-05 10:17:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:17:12,314 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2019-08-05 10:17:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:12,315 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:17:12,315 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:17:12,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:17:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:17:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-05 10:17:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:17:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-08-05 10:17:12,318 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 162 [2019-08-05 10:17:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:12,318 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-08-05 10:17:12,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:17:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-08-05 10:17:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:17:12,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:12,319 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 3, 1, 1, 1] [2019-08-05 10:17:12,319 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash 631933658, now seen corresponding path program 81 times [2019-08-05 10:17:12,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:12,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:17:12,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 0 proven. 6475 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:14,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:17:14,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:17:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:17:14,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:17:14,573 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 82 states. [2019-08-05 10:17:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:14,984 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2019-08-05 10:17:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:17:14,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 164 [2019-08-05 10:17:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:14,986 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:17:14,986 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:17:14,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:17:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:17:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-05 10:17:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:17:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-08-05 10:17:14,989 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 164 [2019-08-05 10:17:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:14,990 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-08-05 10:17:14,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:17:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-08-05 10:17:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:17:14,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:14,991 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 3, 1, 1, 1] [2019-08-05 10:17:14,991 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1697922114, now seen corresponding path program 82 times [2019-08-05 10:17:14,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6643 backedges. 0 proven. 6637 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:17,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:17,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:17:17,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:17:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:17:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:17:17,636 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 83 states. [2019-08-05 10:17:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:18,079 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2019-08-05 10:17:18,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:17:18,079 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 166 [2019-08-05 10:17:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:18,081 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:17:18,081 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:17:18,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:17:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:17:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-05 10:17:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:17:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-08-05 10:17:18,084 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 166 [2019-08-05 10:17:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:18,084 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-08-05 10:17:18,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:17:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-08-05 10:17:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:17:18,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:18,085 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 3, 1, 1, 1] [2019-08-05 10:17:18,085 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -384355414, now seen corresponding path program 83 times [2019-08-05 10:17:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:18,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:17:18,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 0 proven. 6801 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:17:20,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:17:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:17:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:17:20,483 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 84 states. [2019-08-05 10:17:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:20,939 INFO L93 Difference]: Finished difference Result 171 states and 253 transitions. [2019-08-05 10:17:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:17:20,939 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2019-08-05 10:17:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:20,940 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:17:20,940 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:17:20,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:17:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:17:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-05 10:17:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:17:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2019-08-05 10:17:20,943 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 168 [2019-08-05 10:17:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:20,943 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2019-08-05 10:17:20,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:17:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2019-08-05 10:17:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:17:20,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:20,945 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 3, 1, 1, 1] [2019-08-05 10:17:20,945 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1700114, now seen corresponding path program 84 times [2019-08-05 10:17:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:20,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:17:20,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6973 backedges. 0 proven. 6967 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:17:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:17:23,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:17:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:17:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:17:23,777 INFO L87 Difference]: Start difference. First operand 171 states and 253 transitions. Second operand 85 states. [2019-08-05 10:17:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:24,250 INFO L93 Difference]: Finished difference Result 173 states and 256 transitions. [2019-08-05 10:17:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:17:24,251 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2019-08-05 10:17:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:24,252 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:17:24,252 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:17:24,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:17:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:17:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-05 10:17:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:17:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2019-08-05 10:17:24,256 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 170 [2019-08-05 10:17:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:24,256 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2019-08-05 10:17:24,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:17:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2019-08-05 10:17:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:17:24,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:24,257 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 3, 1, 1, 1] [2019-08-05 10:17:24,257 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1633875066, now seen corresponding path program 85 times [2019-08-05 10:17:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:24,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:17:24,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 411 proven. 6 refuted. 0 times theorem prover too weak. 6724 trivial. 0 not checked. [2019-08-05 10:17:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:17:24,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:17:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:17:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:24,459 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand 7 states. [2019-08-05 10:17:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:24,641 INFO L93 Difference]: Finished difference Result 174 states and 257 transitions. [2019-08-05 10:17:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:17:24,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-08-05 10:17:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:24,642 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:17:24,643 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:17:24,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:17:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 10:17:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:17:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2019-08-05 10:17:24,648 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 172 [2019-08-05 10:17:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:24,648 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2019-08-05 10:17:24,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:17:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2019-08-05 10:17:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:17:24,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:24,650 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 4, 1, 1, 1] [2019-08-05 10:17:24,650 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash -591797061, now seen corresponding path program 86 times [2019-08-05 10:17:24,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:24,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:17:24,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7227 backedges. 0 proven. 7217 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:28,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:28,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:17:28,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:17:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:17:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:17:28,031 INFO L87 Difference]: Start difference. First operand 174 states and 257 transitions. Second operand 86 states. [2019-08-05 10:17:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:28,636 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2019-08-05 10:17:28,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:17:28,636 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 173 [2019-08-05 10:17:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:28,638 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:17:28,638 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:17:28,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:17:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:17:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:17:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:17:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 260 transitions. [2019-08-05 10:17:28,641 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 260 transitions. Word has length 173 [2019-08-05 10:17:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:28,641 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 260 transitions. [2019-08-05 10:17:28,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:17:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 260 transitions. [2019-08-05 10:17:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:17:28,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:28,642 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 4, 1, 1, 1] [2019-08-05 10:17:28,642 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1781227037, now seen corresponding path program 87 times [2019-08-05 10:17:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:28,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:17:28,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7398 backedges. 0 proven. 7388 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:31,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:17:31,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:17:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:17:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:17:31,267 INFO L87 Difference]: Start difference. First operand 176 states and 260 transitions. Second operand 87 states. [2019-08-05 10:17:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:31,959 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2019-08-05 10:17:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:17:31,959 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 175 [2019-08-05 10:17:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:31,960 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:17:31,960 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:17:31,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:17:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:17:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 10:17:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:17:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 263 transitions. [2019-08-05 10:17:31,964 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 263 transitions. Word has length 175 [2019-08-05 10:17:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:31,964 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 263 transitions. [2019-08-05 10:17:31,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:17:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 263 transitions. [2019-08-05 10:17:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:17:31,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,965 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 4, 1, 1, 1] [2019-08-05 10:17:31,965 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1932834059, now seen corresponding path program 88 times [2019-08-05 10:17:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7571 backedges. 0 proven. 7561 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:34,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:34,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:17:34,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:17:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:17:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:17:34,710 INFO L87 Difference]: Start difference. First operand 178 states and 263 transitions. Second operand 88 states. [2019-08-05 10:17:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,302 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2019-08-05 10:17:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:17:35,302 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 177 [2019-08-05 10:17:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,304 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:17:35,304 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:17:35,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:17:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:17:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:17:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:17:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 266 transitions. [2019-08-05 10:17:35,307 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 266 transitions. Word has length 177 [2019-08-05 10:17:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,307 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 266 transitions. [2019-08-05 10:17:35,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:17:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2019-08-05 10:17:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:17:35,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,308 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 4, 1, 1, 1] [2019-08-05 10:17:35,308 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2027724339, now seen corresponding path program 89 times [2019-08-05 10:17:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7746 backedges. 0 proven. 7736 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:38,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:38,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:17:38,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:17:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:17:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:17:38,130 INFO L87 Difference]: Start difference. First operand 180 states and 266 transitions. Second operand 89 states. [2019-08-05 10:17:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,644 INFO L93 Difference]: Finished difference Result 182 states and 269 transitions. [2019-08-05 10:17:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:17:38,644 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 179 [2019-08-05 10:17:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,645 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:17:38,646 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:17:38,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:17:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:17:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 10:17:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:17:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 269 transitions. [2019-08-05 10:17:38,648 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 269 transitions. Word has length 179 [2019-08-05 10:17:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 269 transitions. [2019-08-05 10:17:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:17:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 269 transitions. [2019-08-05 10:17:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:17:38,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,650 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 4, 1, 1, 1] [2019-08-05 10:17:38,650 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1271997093, now seen corresponding path program 90 times [2019-08-05 10:17:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7923 backedges. 0 proven. 7913 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:17:41,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:17:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:17:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:17:41,428 INFO L87 Difference]: Start difference. First operand 182 states and 269 transitions. Second operand 90 states. [2019-08-05 10:17:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:42,070 INFO L93 Difference]: Finished difference Result 184 states and 272 transitions. [2019-08-05 10:17:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:17:42,070 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 181 [2019-08-05 10:17:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:42,071 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:17:42,072 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:17:42,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:17:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:17:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:17:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:17:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2019-08-05 10:17:42,074 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 181 [2019-08-05 10:17:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:42,074 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2019-08-05 10:17:42,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:17:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2019-08-05 10:17:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:17:42,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:42,075 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 4, 1, 1, 1] [2019-08-05 10:17:42,075 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1676538499, now seen corresponding path program 91 times [2019-08-05 10:17:42,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8102 backedges. 0 proven. 8092 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:45,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:45,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:17:45,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:17:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:17:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:17:45,879 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand 91 states. [2019-08-05 10:17:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:47,381 INFO L93 Difference]: Finished difference Result 186 states and 275 transitions. [2019-08-05 10:17:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:17:47,382 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 183 [2019-08-05 10:17:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:47,383 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:17:47,383 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:17:47,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:17:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:17:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 10:17:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:17:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 275 transitions. [2019-08-05 10:17:47,387 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 275 transitions. Word has length 183 [2019-08-05 10:17:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:47,388 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 275 transitions. [2019-08-05 10:17:47,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:17:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 275 transitions. [2019-08-05 10:17:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:17:47,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:47,389 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 4, 1, 1, 1] [2019-08-05 10:17:47,389 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash 540827051, now seen corresponding path program 92 times [2019-08-05 10:17:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:47,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:17:47,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8283 backedges. 0 proven. 8273 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:50,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:17:50,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:17:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:17:50,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:17:50,245 INFO L87 Difference]: Start difference. First operand 186 states and 275 transitions. Second operand 92 states. [2019-08-05 10:17:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:50,835 INFO L93 Difference]: Finished difference Result 188 states and 278 transitions. [2019-08-05 10:17:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:17:50,836 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 185 [2019-08-05 10:17:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:50,837 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:17:50,837 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:17:50,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:17:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:17:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:17:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:17:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 278 transitions. [2019-08-05 10:17:50,841 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 278 transitions. Word has length 185 [2019-08-05 10:17:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:50,841 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 278 transitions. [2019-08-05 10:17:50,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:17:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 278 transitions. [2019-08-05 10:17:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:17:50,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:50,842 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 4, 1, 1, 1] [2019-08-05 10:17:50,842 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash 43818707, now seen corresponding path program 93 times [2019-08-05 10:17:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:50,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:17:50,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 0 proven. 8456 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:53,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:17:53,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:17:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:17:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:17:53,893 INFO L87 Difference]: Start difference. First operand 188 states and 278 transitions. Second operand 93 states. [2019-08-05 10:17:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:54,503 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2019-08-05 10:17:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:17:54,504 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 187 [2019-08-05 10:17:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:54,505 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:17:54,505 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:17:54,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:17:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:17:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 10:17:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:17:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 281 transitions. [2019-08-05 10:17:54,508 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 281 transitions. Word has length 187 [2019-08-05 10:17:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:54,509 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 281 transitions. [2019-08-05 10:17:54,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:17:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 281 transitions. [2019-08-05 10:17:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:17:54,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:54,510 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 4, 1, 1, 1] [2019-08-05 10:17:54,510 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -839830021, now seen corresponding path program 94 times [2019-08-05 10:17:54,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:17:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8651 backedges. 0 proven. 8641 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:17:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:17:57,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:17:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:17:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:17:57,856 INFO L87 Difference]: Start difference. First operand 190 states and 281 transitions. Second operand 94 states. [2019-08-05 10:17:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,479 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2019-08-05 10:17:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:17:58,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 189 [2019-08-05 10:17:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,481 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:17:58,481 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:17:58,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:17:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:17:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 10:17:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:17:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2019-08-05 10:17:58,483 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 189 [2019-08-05 10:17:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,484 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2019-08-05 10:17:58,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:17:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2019-08-05 10:17:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 10:17:58,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,485 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 4, 1, 1, 1] [2019-08-05 10:17:58,486 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash 377266979, now seen corresponding path program 95 times [2019-08-05 10:17:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 0 proven. 8828 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:02,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:18:02,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:18:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:18:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:18:02,315 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand 95 states. [2019-08-05 10:18:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,063 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2019-08-05 10:18:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:18:03,064 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 191 [2019-08-05 10:18:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,065 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:18:03,065 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:18:03,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:18:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:18:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 10:18:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:18:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-08-05 10:18:03,069 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 191 [2019-08-05 10:18:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,069 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-08-05 10:18:03,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:18:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-08-05 10:18:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:18:03,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,070 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 4, 1, 1, 1] [2019-08-05 10:18:03,070 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1776379467, now seen corresponding path program 96 times [2019-08-05 10:18:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9027 backedges. 0 proven. 9017 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:06,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:06,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:18:06,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:18:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:18:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:18:06,128 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 96 states. [2019-08-05 10:18:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:06,777 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2019-08-05 10:18:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:18:06,777 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 193 [2019-08-05 10:18:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:06,779 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:18:06,779 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:18:06,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:18:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:18:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:18:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:18:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2019-08-05 10:18:06,783 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 193 [2019-08-05 10:18:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:06,783 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2019-08-05 10:18:06,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:18:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2019-08-05 10:18:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:18:06,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:06,785 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 4, 1, 1, 1] [2019-08-05 10:18:06,785 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1998716787, now seen corresponding path program 97 times [2019-08-05 10:18:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:06,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:18:06,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9218 backedges. 0 proven. 9208 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:10,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:18:10,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:18:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:18:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:18:10,164 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand 97 states. [2019-08-05 10:18:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,841 INFO L93 Difference]: Finished difference Result 198 states and 293 transitions. [2019-08-05 10:18:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:18:10,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 195 [2019-08-05 10:18:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,842 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:18:10,843 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:18:10,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:18:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:18:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 10:18:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:18:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 293 transitions. [2019-08-05 10:18:10,846 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 293 transitions. Word has length 195 [2019-08-05 10:18:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,846 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 293 transitions. [2019-08-05 10:18:10,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:18:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 293 transitions. [2019-08-05 10:18:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:18:10,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,847 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 4, 1, 1, 1] [2019-08-05 10:18:10,848 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash 916516507, now seen corresponding path program 98 times [2019-08-05 10:18:10,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9411 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:14,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:14,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:18:14,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:18:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:18:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:18:14,450 INFO L87 Difference]: Start difference. First operand 198 states and 293 transitions. Second operand 98 states. [2019-08-05 10:18:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,137 INFO L93 Difference]: Finished difference Result 200 states and 296 transitions. [2019-08-05 10:18:15,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:18:15,137 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 197 [2019-08-05 10:18:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,139 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:18:15,139 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:18:15,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:18:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:18:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 10:18:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:18:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2019-08-05 10:18:15,142 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 197 [2019-08-05 10:18:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,142 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2019-08-05 10:18:15,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:18:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2019-08-05 10:18:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:18:15,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,143 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 4, 1, 1, 1] [2019-08-05 10:18:15,143 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 304133059, now seen corresponding path program 99 times [2019-08-05 10:18:15,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9606 backedges. 0 proven. 9596 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:18,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:18:18,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:18:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:18:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:18:18,864 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand 99 states. [2019-08-05 10:18:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,566 INFO L93 Difference]: Finished difference Result 202 states and 299 transitions. [2019-08-05 10:18:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:18:19,567 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 199 [2019-08-05 10:18:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,568 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:18:19,568 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:18:19,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:18:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:18:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 10:18:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:18:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2019-08-05 10:18:19,571 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 199 [2019-08-05 10:18:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,571 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2019-08-05 10:18:19,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:18:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2019-08-05 10:18:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 10:18:19,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,573 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 4, 1, 1, 1] [2019-08-05 10:18:19,573 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 214159083, now seen corresponding path program 100 times [2019-08-05 10:18:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9803 backedges. 0 proven. 9793 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:23,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:18:23,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:18:23,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:18:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:18:23,293 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 100 states. [2019-08-05 10:18:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,029 INFO L93 Difference]: Finished difference Result 204 states and 302 transitions. [2019-08-05 10:18:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:18:24,030 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 201 [2019-08-05 10:18:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,031 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:18:24,031 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:18:24,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:18:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:18:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 10:18:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:18:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 302 transitions. [2019-08-05 10:18:24,034 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 302 transitions. Word has length 201 [2019-08-05 10:18:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,034 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 302 transitions. [2019-08-05 10:18:24,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:18:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 302 transitions. [2019-08-05 10:18:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:18:24,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,035 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 4, 1, 1, 1] [2019-08-05 10:18:24,035 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash -351485933, now seen corresponding path program 101 times [2019-08-05 10:18:24,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10002 backedges. 0 proven. 9992 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:27,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:18:27,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:18:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:18:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:18:27,375 INFO L87 Difference]: Start difference. First operand 204 states and 302 transitions. Second operand 101 states. [2019-08-05 10:18:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,299 INFO L93 Difference]: Finished difference Result 206 states and 305 transitions. [2019-08-05 10:18:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:18:28,299 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 203 [2019-08-05 10:18:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,300 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:18:28,300 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:18:28,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:18:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:18:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 10:18:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:18:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 305 transitions. [2019-08-05 10:18:28,303 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 305 transitions. Word has length 203 [2019-08-05 10:18:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,304 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 305 transitions. [2019-08-05 10:18:28,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:18:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 305 transitions. [2019-08-05 10:18:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 10:18:28,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,305 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 4, 1, 1, 1] [2019-08-05 10:18:28,305 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1524500283, now seen corresponding path program 102 times [2019-08-05 10:18:28,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10203 backedges. 0 proven. 10193 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:31,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:18:31,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:18:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:18:31,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:18:31,856 INFO L87 Difference]: Start difference. First operand 206 states and 305 transitions. Second operand 102 states. [2019-08-05 10:18:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:32,631 INFO L93 Difference]: Finished difference Result 208 states and 308 transitions. [2019-08-05 10:18:32,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:18:32,632 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 205 [2019-08-05 10:18:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:32,633 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:18:32,633 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:18:32,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:18:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:18:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-08-05 10:18:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:18:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions. [2019-08-05 10:18:32,637 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 205 [2019-08-05 10:18:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:32,637 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions. [2019-08-05 10:18:32,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:18:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions. [2019-08-05 10:18:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:18:32,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:32,638 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 4, 1, 1, 1] [2019-08-05 10:18:32,639 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 460989539, now seen corresponding path program 103 times [2019-08-05 10:18:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:32,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:18:32,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:18:36,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:18:36,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:18:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:18:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:18:36,589 INFO L87 Difference]: Start difference. First operand 208 states and 308 transitions. Second operand 103 states. [2019-08-05 10:18:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,387 INFO L93 Difference]: Finished difference Result 210 states and 311 transitions. [2019-08-05 10:18:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:18:37,388 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 207 [2019-08-05 10:18:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,388 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:18:37,388 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:18:37,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:18:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:18:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-08-05 10:18:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 10:18:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2019-08-05 10:18:37,391 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 207 [2019-08-05 10:18:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,391 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2019-08-05 10:18:37,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:18:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2019-08-05 10:18:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 10:18:37,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,392 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 4, 1, 1, 1] [2019-08-05 10:18:37,392 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 629381003, now seen corresponding path program 104 times [2019-08-05 10:18:37,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10611 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 10510 trivial. 0 not checked. [2019-08-05 10:18:37,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:18:37,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:18:37,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:18:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:18:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:18:37,466 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 3 states. [2019-08-05 10:18:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,467 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2019-08-05 10:18:37,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:18:37,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-08-05 10:18:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,468 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:18:37,468 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:18:37,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 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:18:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:18:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:18:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:18:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:18:37,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2019-08-05 10:18:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,469 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:18:37,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:18:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:18:37,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:18:37,475 INFO L202 PluginConnector]: Adding new model cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:18:37 BoogieIcfgContainer [2019-08-05 10:18:37,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:18:37,478 INFO L168 Benchmark]: Toolchain (without parser) took 184658.12 ms. Allocated memory was 141.0 MB in the beginning and 552.6 MB in the end (delta: 411.6 MB). Free memory was 110.7 MB in the beginning and 425.9 MB in the end (delta: -315.2 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,478 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 109.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,479 INFO L168 Benchmark]: Boogie Preprocessor took 23.10 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,480 INFO L168 Benchmark]: RCFGBuilder took 302.90 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 98.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,481 INFO L168 Benchmark]: TraceAbstraction took 184291.25 ms. Allocated memory was 141.0 MB in the beginning and 552.6 MB in the end (delta: 411.6 MB). Free memory was 98.2 MB in the beginning and 425.9 MB in the end (delta: -327.7 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:37,484 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 109.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.10 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.90 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 98.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184291.25 ms. Allocated memory was 141.0 MB in the beginning and 552.6 MB in the end (delta: 411.6 MB). Free memory was 98.2 MB in the beginning and 425.9 MB in the end (delta: -327.7 MB). Peak memory consumption was 83.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 184.2s OverallTime, 106 OverallIterations, 101 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 428 SDtfs, 12496 SDslu, 5957 SDs, 0 SdLazy, 11332 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11024 GetRequests, 5852 SyntacticMatches, 0 SemanticMatches, 5172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 147.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 106 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 150.2s InterpolantComputationTime, 11123 NumberOfCodeBlocks, 11123 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 11017 ConstructedInterpolants, 2 QuantifiedInterpolants, 4451806 SizeOfPredicates, 109 NumberOfNonLiveVariables, 39351 ConjunctsInSsa, 5277 ConjunctsInUnsatCore, 106 InterpolantComputations, 3 PerfectInterpolantSequences, 18428/373267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...