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/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_46.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:59:26,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:59:26,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:59:26,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:59:26,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:59:26,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:59:26,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:59:26,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:59:26,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:59:26,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:59:26,283 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:59:26,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:59:26,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:59:26,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:59:26,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:59:26,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:59:26,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:59:26,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:59:26,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:59:26,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:59:26,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:59:26,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:59:26,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:59:26,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:59:26,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:59:26,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:59:26,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:59:26,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:59:26,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:59:26,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:59:26,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:59:26,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:59:26,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:59:26,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:59:26,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:59:26,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:59:26,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:59:26,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:59:26,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:59:26,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:59:26,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:59:26,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:59:26,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:59:26,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:59:26,405 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:59:26,405 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:59:26,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_46.bpl [2019-08-05 10:59:26,407 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_46.bpl' [2019-08-05 10:59:26,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:59:26,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:59:26,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:26,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:59:26,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:59:26,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:26,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:59:26,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:59:26,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:59:26,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/1) ... [2019-08-05 10:59:26,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:59:26,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:59:26,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:59:26,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:59:26,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (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:59:26,667 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:59:26,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:59:26,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:59:27,039 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:59:27,040 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:59:27,041 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:27 BoogieIcfgContainer [2019-08-05 10:59:27,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:59:27,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:59:27,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:59:27,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:59:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:26" (1/2) ... [2019-08-05 10:59:27,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e8c627 and model type 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:59:27, skipping insertion in model container [2019-08-05 10:59:27,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:27" (2/2) ... [2019-08-05 10:59:27,050 INFO L109 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_46.bpl [2019-08-05 10:59:27,070 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:59:27,082 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:59:27,100 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:59:27,151 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:59:27,155 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:59:27,156 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:59:27,156 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:59:27,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:59:27,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:59:27,157 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:59:27,157 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:59:27,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:59:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:59:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:59:27,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:27,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:59:27,196 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28815973, now seen corresponding path program 1 times [2019-08-05 10:59:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:27,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:59:27,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,424 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:59:27,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:59:27,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:59:27,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:59:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:59:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:59:27,450 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 10:59:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:27,493 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:59:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:59:27,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:59:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:27,505 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:59:27,506 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:59:27,508 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:59:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:59:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:59:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:59:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:59:27,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:59:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:27,543 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:59:27,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:59:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:59:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:59:27,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:27,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:59:27,544 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash 891384587, now seen corresponding path program 1 times [2019-08-05 10:59:27,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:27,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:59:27,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:59:27,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:59:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:59:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:59:27,714 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:59:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:27,761 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:59:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:59:27,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:59:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:27,776 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:59:27,776 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:59:27,777 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:59:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:59:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:59:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:59:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:59:27,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:59:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:27,780 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:59:27,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:59:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:59:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:59:27,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:27,781 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:59:27,782 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1861207845, now seen corresponding path program 2 times [2019-08-05 10:59:27,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:27,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:59:27,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:27,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:27,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:59:27,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:59:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:59:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:27,952 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 10:59:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:28,039 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:59:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:59:28,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:59:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:28,041 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:59:28,041 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:59:28,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:59:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:59:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:59:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:59:28,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 10:59:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:28,044 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:59:28,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:59:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:59:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:59:28,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,045 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:59:28,045 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1860957771, now seen corresponding path program 3 times [2019-08-05 10:59:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:28,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:59:28,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:59:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:59:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:59:28,336 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 10:59:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:28,454 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:59:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:59:28,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:59:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:28,456 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:59:28,456 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:59:28,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:59:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:59:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:59:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:59:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:59:28,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:59:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:28,460 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:59:28,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:59:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:59:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:59:28,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,461 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:59:28,461 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1853205477, now seen corresponding path program 4 times [2019-08-05 10:59:28,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:28,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:28,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:59:28,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:59:28,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:59:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:28,681 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2019-08-05 10:59:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:28,729 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:59:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:59:28,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:59:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:28,732 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:59:28,732 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:59:28,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:59:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:59:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:59:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:59:28,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 10:59:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:28,736 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:59:28,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:59:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:59:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:59:28,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,736 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:59:28,737 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1612884363, now seen corresponding path program 5 times [2019-08-05 10:59:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:29,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:59:29,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:59:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:59:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:59:29,050 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 10:59:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,090 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 10:59:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:59:29,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:59:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,091 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:59:29,092 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:59:29,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:59:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:59:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:59:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:59:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:59:29,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 10:59:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,095 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:59:29,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:59:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:59:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:59:29,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,096 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:59:29,096 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1542102875, now seen corresponding path program 6 times [2019-08-05 10:59:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:29,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:59:29,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:29,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:59:29,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:59:29,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:59:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:29,269 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2019-08-05 10:59:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,327 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:59:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:59:29,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:59:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,329 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:59:29,329 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:59:29,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:59:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:59:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:59:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:59:29,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:59:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,334 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:59:29,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:59:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:59:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:59:29,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,335 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:59:29,335 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash -562459445, now seen corresponding path program 7 times [2019-08-05 10:59:29,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:29,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:59:29,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:29,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:59:29,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:59:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:59:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:59:29,895 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2019-08-05 10:59:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,976 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:59:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:59:29,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 10:59:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,977 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:59:29,977 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:59:29,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:59:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:59:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:59:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:59:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 10:59:29,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 10:59:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,982 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 10:59:29,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:59:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 10:59:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:59:29,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,983 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:59:29,983 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash -258284187, now seen corresponding path program 8 times [2019-08-05 10:59:29,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:30,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:30,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:59:30,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:59:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:59:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:30,308 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2019-08-05 10:59:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:30,365 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:59:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:59:30,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:59:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:30,366 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:59:30,366 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:59:30,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:59:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:59:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:59:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:59:30,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 10:59:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:30,370 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:59:30,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:59:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:59:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:59:30,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:30,371 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:59:30,371 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash 581214219, now seen corresponding path program 9 times [2019-08-05 10:59:30,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:30,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:30,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:59:30,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:59:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:59:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:59:30,680 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2019-08-05 10:59:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:30,746 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:59:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:59:30,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-05 10:59:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:30,747 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:59:30,747 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:59:30,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:59:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:59:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:59:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:59:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:59:30,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:59:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:30,750 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:59:30,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:59:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:59:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:59:30,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:30,751 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:59:30,752 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash 835861029, now seen corresponding path program 10 times [2019-08-05 10:59:30,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:31,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:31,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:59:31,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:59:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:59:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:31,086 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2019-08-05 10:59:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:31,127 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:59:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:59:31,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-08-05 10:59:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:31,129 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:59:31,129 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:59:31,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:59:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:59:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:59:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:59:31,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-08-05 10:59:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:31,133 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:59:31,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:59:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:59:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:59:31,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:31,134 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:59:31,134 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:31,135 INFO L82 PathProgramCache]: Analyzing trace with hash 139977547, now seen corresponding path program 11 times [2019-08-05 10:59:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:31,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:59:31,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:31,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:59:31,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:59:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:59:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:59:31,488 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2019-08-05 10:59:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:31,537 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 10:59:31,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:59:31,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-08-05 10:59:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:31,540 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:59:31,540 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:59:31,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:59:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:59:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:59:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:59:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:59:31,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-08-05 10:59:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:31,543 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:59:31,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:59:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:59:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:59:31,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:31,544 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:59:31,544 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash 42426085, now seen corresponding path program 12 times [2019-08-05 10:59:31,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:31,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:59:31,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:32,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:32,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:59:32,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:59:32,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:59:32,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:32,006 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 15 states. [2019-08-05 10:59:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:32,071 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:59:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:59:32,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-08-05 10:59:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:32,073 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:59:32,073 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:59:32,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:59:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:59:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:59:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:59:32,076 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-05 10:59:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:32,076 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:59:32,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:59:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:59:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:59:32,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:32,077 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:59:32,077 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1313298059, now seen corresponding path program 13 times [2019-08-05 10:59:32,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:32,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:59:32,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:33,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:33,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:59:33,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:59:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:59:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:59:33,111 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2019-08-05 10:59:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:33,215 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 10:59:33,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:59:33,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-08-05 10:59:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:33,218 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:59:33,218 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:59:33,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:59:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:59:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:59:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:59:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 10:59:33,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-08-05 10:59:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:33,228 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 10:59:33,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:59:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 10:59:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:59:33,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:33,228 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:59:33,229 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2055623589, now seen corresponding path program 14 times [2019-08-05 10:59:33,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:33,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:59:33,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:59:33,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:59:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:59:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:33,642 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-08-05 10:59:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:33,702 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:59:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:59:33,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-08-05 10:59:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:33,705 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:59:33,705 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:59:33,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:59:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:59:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:59:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:59:33,709 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-08-05 10:59:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:33,709 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:59:33,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:59:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:59:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:59:33,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:33,710 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:59:33,710 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash -702088757, now seen corresponding path program 15 times [2019-08-05 10:59:33,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:33,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:59:33,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:34,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:34,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:59:34,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:59:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:59:34,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:59:34,589 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2019-08-05 10:59:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:34,634 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:59:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:59:34,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-08-05 10:59:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:34,636 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:59:34,637 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:59:34,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:59:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:59:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:59:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:59:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:59:34,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-05 10:59:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:34,640 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:59:34,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:59:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:59:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:59:34,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:34,641 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:59:34,641 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -291825563, now seen corresponding path program 16 times [2019-08-05 10:59:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:34,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:59:34,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:35,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:35,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:59:35,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:59:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:59:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:59:35,093 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 19 states. [2019-08-05 10:59:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,160 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:59:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:59:35,166 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-08-05 10:59:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,167 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:59:35,167 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:59:35,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 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:59:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:59:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:59:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:59:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:59:35,170 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2019-08-05 10:59:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,170 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:59:35,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:59:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:59:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:59:35,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,171 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:59:35,172 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash -458568437, now seen corresponding path program 17 times [2019-08-05 10:59:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:35,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:59:35,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:59:36,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:59:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:59:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:59:36,024 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2019-08-05 10:59:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:36,092 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 10:59:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:59:36,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-08-05 10:59:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:36,093 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:59:36,093 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:59:36,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:59:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:59:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:59:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:59:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:59:36,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-05 10:59:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:36,098 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:59:36,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:59:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:59:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:59:36,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:36,099 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:59:36,099 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1332630235, now seen corresponding path program 18 times [2019-08-05 10:59:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:36,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:59:36,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:59:36,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:59:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:59:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:59:36,525 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-08-05 10:59:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:36,580 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:59:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:59:36,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-08-05 10:59:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:36,581 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:59:36,581 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:59:36,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:59:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:59:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:59:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:59:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:59:36,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-08-05 10:59:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:36,585 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:59:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:59:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:59:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:59:36,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:36,587 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:59:36,587 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1636225099, now seen corresponding path program 19 times [2019-08-05 10:59:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:36,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:59:36,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:36,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:36,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:59:36,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:59:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:59:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:59:36,949 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 22 states. [2019-08-05 10:59:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:37,000 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 10:59:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:59:37,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-08-05 10:59:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:37,001 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:59:37,001 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:59:37,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:59:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:59:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:59:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:59:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 10:59:37,006 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2019-08-05 10:59:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:37,006 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 10:59:37,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:59:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 10:59:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:59:37,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:37,007 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1] [2019-08-05 10:59:37,007 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:37,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash -818540059, now seen corresponding path program 20 times [2019-08-05 10:59:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:37,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:59:37,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:59:37,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:59:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:59:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:37,407 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-08-05 10:59:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:37,460 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:59:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:59:37,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-08-05 10:59:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:37,461 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:59:37,461 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:59:37,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:59:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:59:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:59:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:59:37,464 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2019-08-05 10:59:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:37,465 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:59:37,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:59:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:59:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:59:37,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:37,466 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1] [2019-08-05 10:59:37,466 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 393151371, now seen corresponding path program 21 times [2019-08-05 10:59:37,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:37,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:59:37,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:38,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:59:38,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:59:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:59:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:59:38,248 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-08-05 10:59:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:38,323 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:59:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:59:38,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-08-05 10:59:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:38,328 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:59:38,328 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:59:38,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:59:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:59:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:59:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:59:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 10:59:38,331 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-05 10:59:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:38,331 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 10:59:38,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:59:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 10:59:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:59:38,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:38,332 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2019-08-05 10:59:38,332 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -699119963, now seen corresponding path program 22 times [2019-08-05 10:59:38,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:38,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:59:38,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:38,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:38,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:59:38,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:59:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:59:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:59:38,990 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2019-08-05 10:59:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:39,057 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:59:39,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:59:39,058 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-08-05 10:59:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:39,059 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:59:39,059 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:59:39,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:59:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:59:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:59:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:59:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:59:39,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-08-05 10:59:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:39,063 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:59:39,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:59:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:59:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:59:39,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:39,064 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1] [2019-08-05 10:59:39,064 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash -199792949, now seen corresponding path program 23 times [2019-08-05 10:59:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:39,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:59:39,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:39,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:39,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:59:39,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:59:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:59:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:59:39,664 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2019-08-05 10:59:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:39,715 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-08-05 10:59:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:59:39,721 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-08-05 10:59:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:39,722 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:59:39,722 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:59:39,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:59:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:59:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:59:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:59:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:59:39,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-08-05 10:59:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:39,725 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:59:39,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:59:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:59:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:59:39,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:39,726 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1] [2019-08-05 10:59:39,726 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1900524699, now seen corresponding path program 24 times [2019-08-05 10:59:39,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:39,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:59:39,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:59:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:59:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:59:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:40,470 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 27 states. [2019-08-05 10:59:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:40,700 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:59:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:59:40,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-08-05 10:59:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:40,701 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:59:40,701 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:59:40,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:59:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:59:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:59:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:59:40,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:59:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:40,705 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:59:40,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:59:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:59:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:59:40,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:40,706 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1] [2019-08-05 10:59:40,706 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1211365899, now seen corresponding path program 25 times [2019-08-05 10:59:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:40,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:59:40,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:41,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:41,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:59:41,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:59:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:59:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:59:41,588 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2019-08-05 10:59:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:41,640 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 10:59:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:59:41,640 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-08-05 10:59:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:41,641 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:59:41,641 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:59:41,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:59:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:59:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:59:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:59:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 10:59:41,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-08-05 10:59:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:41,645 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 10:59:41,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:59:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 10:59:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:59:41,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:41,646 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1] [2019-08-05 10:59:41,646 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1104273371, now seen corresponding path program 26 times [2019-08-05 10:59:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:41,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:59:41,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:42,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:59:42,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:59:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:59:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:59:42,641 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-08-05 10:59:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:42,688 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:59:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:59:42,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2019-08-05 10:59:42,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:42,689 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:59:42,689 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:59:42,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:59:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:59:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:59:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:59:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:59:42,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-08-05 10:59:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:42,694 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:59:42,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:59:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:59:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:59:42,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:42,695 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1] [2019-08-05 10:59:42,695 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 125353291, now seen corresponding path program 27 times [2019-08-05 10:59:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:42,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:59:42,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:43,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:59:43,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:59:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:59:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:59:43,797 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2019-08-05 10:59:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:43,862 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 10:59:43,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:59:43,862 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2019-08-05 10:59:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:43,862 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:59:43,863 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:59:43,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:59:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:59:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:59:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:59:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:59:43,865 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-05 10:59:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:43,866 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:59:43,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:59:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:59:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:59:43,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:43,867 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1] [2019-08-05 10:59:43,867 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash -410925851, now seen corresponding path program 28 times [2019-08-05 10:59:43,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:43,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:59:43,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:59:44,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:59:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:59:44,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:44,499 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2019-08-05 10:59:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:44,559 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:59:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:59:44,559 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-08-05 10:59:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:44,560 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:59:44,560 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:59:44,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:59:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:59:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:59:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:59:44,563 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2019-08-05 10:59:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:44,563 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:59:44,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:59:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:59:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:59:44,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:44,564 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1] [2019-08-05 10:59:44,565 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 144289931, now seen corresponding path program 29 times [2019-08-05 10:59:44,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:44,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:59:44,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:45,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:45,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:59:45,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:59:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:59:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:59:45,251 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2019-08-05 10:59:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:45,351 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 10:59:45,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:59:45,351 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2019-08-05 10:59:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:45,352 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:59:45,353 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:59:45,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:59:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:59:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:59:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:59:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 10:59:45,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-08-05 10:59:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:45,357 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 10:59:45,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:59:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 10:59:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:59:45,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:45,358 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1] [2019-08-05 10:59:45,358 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 176109989, now seen corresponding path program 30 times [2019-08-05 10:59:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:45,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:59:45,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:46,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:59:46,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:59:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:59:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:46,243 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2019-08-05 10:59:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:46,319 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:59:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:59:46,320 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2019-08-05 10:59:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:46,321 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:59:46,321 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:59:46,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:59:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:59:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:59:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:59:46,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-08-05 10:59:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:46,325 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:59:46,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:59:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:59:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:59:46,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:46,326 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1] [2019-08-05 10:59:46,327 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1162531787, now seen corresponding path program 31 times [2019-08-05 10:59:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:46,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:59:46,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:46,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:46,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:59:46,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:59:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:59:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:59:46,968 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2019-08-05 10:59:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:47,061 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 10:59:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:59:47,061 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2019-08-05 10:59:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:47,062 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:59:47,062 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:59:47,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:59:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:59:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:59:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:59:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 10:59:47,065 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2019-08-05 10:59:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:47,065 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 10:59:47,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:59:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 10:59:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:59:47,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:47,066 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1] [2019-08-05 10:59:47,067 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1676836453, now seen corresponding path program 32 times [2019-08-05 10:59:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:47,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:59:47,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:47,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:47,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:59:47,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:59:47,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:59:47,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:59:47,913 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-08-05 10:59:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:47,980 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:59:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:59:47,981 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2019-08-05 10:59:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:47,982 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:59:47,982 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:59:47,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:59:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:59:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:59:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:59:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:59:47,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-08-05 10:59:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:47,986 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:59:47,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:59:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:59:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:59:47,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:47,987 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1] [2019-08-05 10:59:47,987 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 440411915, now seen corresponding path program 33 times [2019-08-05 10:59:47,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:48,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:59:48,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:48,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:48,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:59:48,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:59:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:59:48,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:59:48,833 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 36 states. [2019-08-05 10:59:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:48,912 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 10:59:48,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:59:48,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-08-05 10:59:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:48,913 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:59:48,913 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:59:48,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:59:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:59:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:59:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:59:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 10:59:48,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-05 10:59:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:48,917 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 10:59:48,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:59:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 10:59:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:59:48,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:48,918 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1] [2019-08-05 10:59:48,918 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 765956901, now seen corresponding path program 34 times [2019-08-05 10:59:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:48,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:59:48,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:59:49,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:59:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:59:49,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:59:49,706 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 37 states. [2019-08-05 10:59:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:49,820 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 10:59:49,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:59:49,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2019-08-05 10:59:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:49,821 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:59:49,821 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:59:49,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:59:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:59:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:59:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:59:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:59:49,823 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-08-05 10:59:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:49,823 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:59:49,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:59:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:59:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:59:49,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:49,824 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1] [2019-08-05 10:59:49,824 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2027050421, now seen corresponding path program 35 times [2019-08-05 10:59:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:59:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:51,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:51,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:59:51,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:59:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:59:51,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:59:51,573 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 38 states. [2019-08-05 10:59:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:51,681 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 10:59:51,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:59:51,682 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 40 [2019-08-05 10:59:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:51,683 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:59:51,683 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:59:51,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:59:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:59:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:59:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:59:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:59:51,686 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2019-08-05 10:59:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:51,686 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:59:51,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:59:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:59:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:59:51,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:51,687 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1] [2019-08-05 10:59:51,687 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1584035813, now seen corresponding path program 36 times [2019-08-05 10:59:51,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:51,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:59:51,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:59:52,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:59:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:59:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:59:52,963 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 39 states. [2019-08-05 10:59:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:53,052 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:59:53,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:59:53,053 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-08-05 10:59:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:53,053 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:59:53,053 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:59:53,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:59:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:59:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:59:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:59:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:59:53,056 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-05 10:59:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:53,056 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:59:53,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:59:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:59:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:59:53,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:53,057 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1] [2019-08-05 10:59:53,057 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1858559371, now seen corresponding path program 37 times [2019-08-05 10:59:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:53,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:59:53,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:53,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:53,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:59:53,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:59:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:59:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:59:53,991 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 40 states. [2019-08-05 10:59:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:54,075 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 10:59:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:59:54,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 42 [2019-08-05 10:59:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:54,077 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:59:54,077 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:59:54,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:59:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:59:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:59:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:59:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 10:59:54,080 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-08-05 10:59:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:54,080 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 10:59:54,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:59:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 10:59:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:59:54,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:54,081 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1] [2019-08-05 10:59:54,081 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1778855077, now seen corresponding path program 38 times [2019-08-05 10:59:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:54,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:59:54,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:55,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:55,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:59:55,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:59:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:59:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:59:55,040 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 41 states. [2019-08-05 10:59:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:55,139 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 10:59:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:59:55,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 43 [2019-08-05 10:59:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:55,141 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:59:55,141 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:59:55,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:59:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:59:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:59:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:59:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:59:55,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-08-05 10:59:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:55,143 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:59:55,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:59:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:59:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:59:55,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:55,144 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1] [2019-08-05 10:59:55,144 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -691978037, now seen corresponding path program 39 times [2019-08-05 10:59:55,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:55,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:59:55,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:55,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:59:55,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:59:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:59:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:59:55,991 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 42 states. [2019-08-05 10:59:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:56,081 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 10:59:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:59:56,082 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2019-08-05 10:59:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:56,083 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:59:56,083 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:59:56,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:59:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:59:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:59:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:59:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:59:56,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-05 10:59:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:56,087 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:59:56,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:59:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:59:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:59:56,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:56,088 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1] [2019-08-05 10:59:56,088 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 21606757, now seen corresponding path program 40 times [2019-08-05 10:59:56,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:56,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:59:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:57,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:57,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:59:57,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:59:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:59:57,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:59:57,237 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 43 states. [2019-08-05 10:59:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:57,335 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:59:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:59:57,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 45 [2019-08-05 10:59:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:57,336 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:59:57,336 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:59:57,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:59:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:59:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:59:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:59:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:59:57,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2019-08-05 10:59:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:57,340 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:59:57,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:59:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:59:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:59:57,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:57,340 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1] [2019-08-05 10:59:57,341 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 667898891, now seen corresponding path program 41 times [2019-08-05 10:59:57,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:57,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:59:57,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:58,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:58,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:59:58,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:59:58,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:59:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:59:58,379 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-08-05 10:59:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:58,454 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 10:59:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:59:58,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 46 [2019-08-05 10:59:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:58,456 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:59:58,456 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:59:58,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:59:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:59:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:59:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:59:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:59:58,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-08-05 10:59:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:58,459 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:59:58,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:59:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:59:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:59:58,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:58,460 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1] [2019-08-05 10:59:58,460 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash -771881435, now seen corresponding path program 42 times [2019-08-05 10:59:58,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:58,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:59:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:59:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:59:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:59:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:59:59,550 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 45 states. [2019-08-05 10:59:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:59,705 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:59:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:59:59,706 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2019-08-05 10:59:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:59,707 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:59:59,707 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:59:59,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:59:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:59:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:59:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:59:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:59:59,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-08-05 10:59:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:59,711 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:59:59,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:59:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:59:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:59:59,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:59,712 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1] [2019-08-05 10:59:59,712 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1839568715, now seen corresponding path program 43 times [2019-08-05 10:59:59,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:59,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:59:59,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:00,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:00,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:00:00,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:00:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:00:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:00:00,728 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 46 states. [2019-08-05 11:00:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:00,980 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 11:00:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:00:00,981 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 48 [2019-08-05 11:00:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:00,982 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:00:00,982 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:00:00,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:00:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:00:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:00:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:00:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 11:00:00,984 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2019-08-05 11:00:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:00,984 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 11:00:00,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:00:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 11:00:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:00:00,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:00,985 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1] [2019-08-05 11:00:00,985 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144741, now seen corresponding path program 44 times [2019-08-05 11:00:00,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:01,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:00:01,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:03,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:03,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:00:03,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:00:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:00:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:00:03,105 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2019-08-05 11:00:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:03,206 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 11:00:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:00:03,206 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 49 [2019-08-05 11:00:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:03,207 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:00:03,207 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:00:03,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:00:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:00:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:00:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:00:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 11:00:03,210 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2019-08-05 11:00:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:03,210 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 11:00:03,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:00:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 11:00:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:00:03,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:03,210 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1] [2019-08-05 11:00:03,211 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1762129269, now seen corresponding path program 45 times [2019-08-05 11:00:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:03,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:00:03,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:04,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:04,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:00:04,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:00:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:00:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:00:04,453 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2019-08-05 11:00:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:04,567 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 11:00:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:00:04,568 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2019-08-05 11:00:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:04,568 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:00:04,568 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:00:04,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:00:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:00:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:00:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:00:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 11:00:04,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-05 11:00:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:04,571 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 11:00:04,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:00:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 11:00:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:00:04,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:04,572 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1] [2019-08-05 11:00:04,572 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1206656933, now seen corresponding path program 46 times [2019-08-05 11:00:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:04,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:00:04,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:05,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:00:05,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:00:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:00:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:00:05,824 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 49 states. [2019-08-05 11:00:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:05,931 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 11:00:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:00:05,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 51 [2019-08-05 11:00:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:05,933 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:00:05,933 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:00:05,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:00:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:00:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:00:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:00:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 11:00:05,936 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-08-05 11:00:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:05,936 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 11:00:05,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:00:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 11:00:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:00:05,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:05,937 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1] [2019-08-05 11:00:05,937 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1250251317, now seen corresponding path program 47 times [2019-08-05 11:00:05,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:05,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:00:05,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:07,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:07,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:00:07,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:00:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:00:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:00:07,114 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 50 states. [2019-08-05 11:00:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:07,209 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-08-05 11:00:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:00:07,210 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 52 [2019-08-05 11:00:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:07,210 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:00:07,210 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:00:07,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:00:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:00:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:00:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:00:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 11:00:07,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2019-08-05 11:00:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:07,214 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 11:00:07,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:00:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 11:00:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:00:07,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:07,214 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1] [2019-08-05 11:00:07,214 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash -104995739, now seen corresponding path program 48 times [2019-08-05 11:00:07,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:07,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:00:07,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:08,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:08,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:00:08,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:00:08,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:00:08,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:00:08,877 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 51 states. [2019-08-05 11:00:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:08,978 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 11:00:08,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:00:08,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 53 [2019-08-05 11:00:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:08,979 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:00:08,979 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:00:08,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:00:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:00:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:00:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:00:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 11:00:08,981 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-05 11:00:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:08,982 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 11:00:08,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:00:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 11:00:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:00:08,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:08,983 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1] [2019-08-05 11:00:08,983 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1038188811, now seen corresponding path program 49 times [2019-08-05 11:00:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:10,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:10,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:00:10,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:00:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:00:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:00:10,212 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 52 states. [2019-08-05 11:00:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:10,359 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-05 11:00:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:00:10,359 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 54 [2019-08-05 11:00:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:10,360 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:00:10,360 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:00:10,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:00:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:00:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:00:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:00:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-08-05 11:00:10,362 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-08-05 11:00:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:10,363 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-08-05 11:00:10,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:00:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-08-05 11:00:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:00:10,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:10,364 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1] [2019-08-05 11:00:10,364 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2117171493, now seen corresponding path program 50 times [2019-08-05 11:00:10,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:10,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:00:10,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:12,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:00:12,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:00:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:00:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:00:12,107 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 53 states. [2019-08-05 11:00:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:12,232 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 11:00:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:00:12,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 55 [2019-08-05 11:00:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:12,233 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:00:12,233 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:00:12,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:00:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:00:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:00:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:00:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 11:00:12,235 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-08-05 11:00:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:12,236 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 11:00:12,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:00:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 11:00:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:00:12,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:12,237 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1] [2019-08-05 11:00:12,237 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:12,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1205896267, now seen corresponding path program 51 times [2019-08-05 11:00:12,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:12,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:00:12,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:14,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:00:14,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:00:14,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:00:14,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:00:14,067 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 54 states. [2019-08-05 11:00:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:14,175 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 11:00:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:00:14,176 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 56 [2019-08-05 11:00:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:14,177 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:00:14,177 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:00:14,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:00:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:00:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:00:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:00:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 11:00:14,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-05 11:00:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:14,180 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 11:00:14,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:00:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 11:00:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:00:14,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:14,180 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1] [2019-08-05 11:00:14,180 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1273831963, now seen corresponding path program 52 times [2019-08-05 11:00:14,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:14,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:00:14,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:15,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:15,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:00:15,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:00:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:00:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:00:15,526 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 55 states. [2019-08-05 11:00:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:15,669 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 11:00:15,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:00:15,670 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 57 [2019-08-05 11:00:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:15,670 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:00:15,670 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:00:15,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 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 11:00:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:00:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:00:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:00:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 11:00:15,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 57 [2019-08-05 11:00:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:15,674 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 11:00:15,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:00:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 11:00:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:00:15,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:15,675 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1] [2019-08-05 11:00:15,675 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -835995765, now seen corresponding path program 53 times [2019-08-05 11:00:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:15,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:00:15,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:17,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:17,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:00:17,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:00:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:00:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:00:17,313 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 56 states. [2019-08-05 11:00:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:17,419 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-08-05 11:00:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:00:17,420 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 58 [2019-08-05 11:00:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:17,421 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:00:17,421 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:00:17,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:00:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:00:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:00:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:00:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 11:00:17,424 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-08-05 11:00:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:17,425 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 11:00:17,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:00:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 11:00:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:00:17,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:17,426 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1] [2019-08-05 11:00:17,426 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -147975515, now seen corresponding path program 54 times [2019-08-05 11:00:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:17,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:00:17,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:19,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:00:19,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:00:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:00:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:00:19,212 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 57 states. [2019-08-05 11:00:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:19,309 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 11:00:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:00:19,309 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 59 [2019-08-05 11:00:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:19,310 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:00:19,310 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:00:19,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:00:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:00:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:00:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:00:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 11:00:19,313 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-08-05 11:00:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:19,314 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 11:00:19,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:00:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 11:00:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:00:19,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:19,315 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1] [2019-08-05 11:00:19,315 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -294184245, now seen corresponding path program 55 times [2019-08-05 11:00:19,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:19,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:00:19,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:20,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:20,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:00:20,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:00:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:00:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:00:20,923 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 58 states. [2019-08-05 11:00:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:21,090 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-05 11:00:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:00:21,092 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 60 [2019-08-05 11:00:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:21,093 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:00:21,093 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:00:21,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:00:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:00:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:00:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:00:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-05 11:00:21,096 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2019-08-05 11:00:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:21,096 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-05 11:00:21,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:00:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-05 11:00:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:00:21,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:21,096 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1] [2019-08-05 11:00:21,097 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -531687579, now seen corresponding path program 56 times [2019-08-05 11:00:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:21,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:00:21,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:23,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:23,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:00:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:00:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:00:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:00:23,175 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 59 states. [2019-08-05 11:00:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:23,310 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 11:00:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:00:23,311 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 61 [2019-08-05 11:00:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:23,312 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:00:23,312 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:00:23,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:00:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:00:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:00:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:00:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 11:00:23,315 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2019-08-05 11:00:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:23,316 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 11:00:23,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:00:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 11:00:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:00:23,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:23,316 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1] [2019-08-05 11:00:23,317 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:23,317 INFO L82 PathProgramCache]: Analyzing trace with hash 695643659, now seen corresponding path program 57 times [2019-08-05 11:00:23,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:23,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:00:23,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:24,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:24,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:00:24,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:00:24,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:00:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:00:24,951 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 60 states. [2019-08-05 11:00:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:25,083 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 11:00:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:00:25,083 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 62 [2019-08-05 11:00:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:25,084 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:00:25,084 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:00:25,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:00:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:00:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:00:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:00:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 11:00:25,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-05 11:00:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:25,087 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 11:00:25,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:00:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 11:00:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:00:25,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:25,088 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1] [2019-08-05 11:00:25,089 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash 88206373, now seen corresponding path program 58 times [2019-08-05 11:00:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:25,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:00:25,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:26,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:26,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:00:26,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:00:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:00:26,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:00:26,843 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 61 states. [2019-08-05 11:00:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:26,970 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 11:00:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:00:26,971 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 63 [2019-08-05 11:00:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:26,972 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:00:26,972 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:00:26,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:00:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:00:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:00:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:00:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 11:00:26,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-08-05 11:00:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:26,975 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 11:00:26,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:00:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 11:00:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:00:26,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:26,976 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1] [2019-08-05 11:00:26,976 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1562480309, now seen corresponding path program 59 times [2019-08-05 11:00:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:26,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:00:26,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:29,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:00:29,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:00:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:00:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:00:29,136 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 62 states. [2019-08-05 11:00:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:29,274 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-08-05 11:00:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:00:29,275 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 64 [2019-08-05 11:00:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:29,276 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:00:29,276 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:00:29,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:00:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:00:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:00:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:00:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 11:00:29,279 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2019-08-05 11:00:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:29,279 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 11:00:29,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:00:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 11:00:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:00:29,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:29,280 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1] [2019-08-05 11:00:29,280 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1194159899, now seen corresponding path program 60 times [2019-08-05 11:00:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:29,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:00:29,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:00:31,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:00:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:00:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:00:31,081 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 63 states. [2019-08-05 11:00:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:31,210 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 11:00:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:00:31,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 65 [2019-08-05 11:00:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:31,211 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:00:31,211 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:00:31,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:00:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:00:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:00:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:00:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 11:00:31,213 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-05 11:00:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:31,214 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 11:00:31,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:00:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 11:00:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:00:31,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:31,215 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1] [2019-08-05 11:00:31,215 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1633838219, now seen corresponding path program 61 times [2019-08-05 11:00:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:00:31,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:33,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:33,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:00:33,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:00:33,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:00:33,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:00:33,201 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 64 states. [2019-08-05 11:00:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:33,378 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 11:00:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:00:33,383 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 66 [2019-08-05 11:00:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:33,384 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:00:33,384 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:00:33,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:00:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:00:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:00:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:00:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-08-05 11:00:33,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-08-05 11:00:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:33,387 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-08-05 11:00:33,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:00:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-08-05 11:00:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:00:33,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:33,388 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1] [2019-08-05 11:00:33,388 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash -892533339, now seen corresponding path program 62 times [2019-08-05 11:00:33,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:33,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:00:33,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:35,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:35,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:00:35,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:00:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:00:35,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:00:35,243 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 65 states. [2019-08-05 11:00:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:35,387 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-05 11:00:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:00:35,387 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 67 [2019-08-05 11:00:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:35,388 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:00:35,388 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:00:35,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 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 11:00:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:00:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:00:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:00:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 11:00:35,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-08-05 11:00:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:35,392 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 11:00:35,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:00:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 11:00:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:00:35,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:35,393 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1] [2019-08-05 11:00:35,393 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1900640309, now seen corresponding path program 63 times [2019-08-05 11:00:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:00:35,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:00:38,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:00:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:00:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:00:38,090 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 66 states. [2019-08-05 11:00:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:38,305 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 11:00:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:00:38,314 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 68 [2019-08-05 11:00:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:38,315 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:00:38,315 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:00:38,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:00:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:00:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:00:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:00:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 11:00:38,318 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-05 11:00:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:38,318 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 11:00:38,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:00:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 11:00:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:00:38,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:38,319 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1] [2019-08-05 11:00:38,319 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1207781989, now seen corresponding path program 64 times [2019-08-05 11:00:38,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:38,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:00:38,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:40,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:00:40,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:00:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:00:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:00:40,407 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 67 states. [2019-08-05 11:00:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:40,537 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 11:00:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:00:40,537 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 69 [2019-08-05 11:00:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:40,538 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:00:40,538 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:00:40,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:00:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:00:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:00:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:00:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 11:00:40,541 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 69 [2019-08-05 11:00:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:40,541 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 11:00:40,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:00:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 11:00:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:00:40,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:40,542 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1] [2019-08-05 11:00:40,542 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:40,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:40,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1215374581, now seen corresponding path program 65 times [2019-08-05 11:00:40,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:00:42,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:00:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:00:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:00:42,560 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2019-08-05 11:00:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:42,717 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-08-05 11:00:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:00:42,718 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2019-08-05 11:00:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:42,718 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:00:42,719 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:00:42,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:00:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:00:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:00:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:00:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-05 11:00:42,721 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-08-05 11:00:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:42,721 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-05 11:00:42,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:00:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-05 11:00:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:00:42,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:42,722 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1] [2019-08-05 11:00:42,722 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 976183077, now seen corresponding path program 66 times [2019-08-05 11:00:42,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:42,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:00:42,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:45,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:45,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:00:45,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:00:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:00:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:00:45,231 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 69 states. [2019-08-05 11:00:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:45,378 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 11:00:45,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:00:45,379 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 71 [2019-08-05 11:00:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:45,380 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:00:45,380 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:00:45,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:00:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:00:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:00:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:00:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 11:00:45,383 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-08-05 11:00:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:45,384 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 11:00:45,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:00:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 11:00:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:00:45,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:45,385 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1] [2019-08-05 11:00:45,385 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash 194993739, now seen corresponding path program 67 times [2019-08-05 11:00:45,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:45,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:00:45,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:47,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:00:47,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:00:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:00:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:00:47,763 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 70 states. [2019-08-05 11:00:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:47,870 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 11:00:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:00:47,870 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 72 [2019-08-05 11:00:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:47,871 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:00:47,871 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:00:47,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:00:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:00:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:00:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:00:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 11:00:47,874 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2019-08-05 11:00:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:47,874 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 11:00:47,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:00:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 11:00:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:00:47,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:47,875 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1] [2019-08-05 11:00:47,875 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:47,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1747928037, now seen corresponding path program 68 times [2019-08-05 11:00:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:47,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:00:47,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:50,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:50,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:00:50,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:00:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:00:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:00:50,498 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 71 states. [2019-08-05 11:00:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:50,727 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 11:00:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:00:50,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 73 [2019-08-05 11:00:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:50,730 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:00:50,730 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:00:50,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:00:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:00:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:00:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:00:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 11:00:50,733 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 73 [2019-08-05 11:00:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:50,734 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 11:00:50,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:00:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 11:00:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:00:50,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:50,735 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1] [2019-08-05 11:00:50,735 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1650716277, now seen corresponding path program 69 times [2019-08-05 11:00:50,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:50,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:00:50,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:53,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:53,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:00:53,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:00:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:00:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:00:53,114 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 72 states. [2019-08-05 11:00:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:53,305 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 11:00:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:00:53,306 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 74 [2019-08-05 11:00:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:53,306 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:00:53,306 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:00:53,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:00:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:00:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:00:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:00:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-05 11:00:53,309 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-05 11:00:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:53,309 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-05 11:00:53,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:00:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-05 11:00:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:00:53,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:53,310 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1] [2019-08-05 11:00:53,310 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 365492389, now seen corresponding path program 70 times [2019-08-05 11:00:53,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:53,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:00:53,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:00:55,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:00:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:00:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:00:55,922 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 73 states. [2019-08-05 11:00:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:56,058 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 11:00:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:00:56,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 75 [2019-08-05 11:00:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:56,060 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:00:56,060 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:00:56,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:00:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:00:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:00:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:00:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 11:00:56,063 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-08-05 11:00:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:56,064 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 11:00:56,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:00:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 11:00:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:00:56,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:56,065 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1] [2019-08-05 11:00:56,065 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1556548405, now seen corresponding path program 71 times [2019-08-05 11:00:56,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:56,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:00:56,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:58,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:58,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:00:58,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:00:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:00:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:00:58,566 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 74 states. [2019-08-05 11:00:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:58,803 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 11:00:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:00:58,803 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 76 [2019-08-05 11:00:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:58,804 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:00:58,804 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:00:58,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:00:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:00:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:00:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:00:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 11:00:58,808 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2019-08-05 11:00:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:58,808 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 11:00:58,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:00:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 11:00:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:00:58,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:58,809 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1, 1] [2019-08-05 11:00:58,809 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1010270875, now seen corresponding path program 72 times [2019-08-05 11:00:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:58,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:00:58,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:01,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:01:01,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:01:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:01:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:01:01,622 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 75 states. [2019-08-05 11:01:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:01,761 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 11:01:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:01:01,762 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 77 [2019-08-05 11:01:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:01,763 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:01:01,763 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:01:01,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:01:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:01:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:01:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:01:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 11:01:01,767 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-05 11:01:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:01,767 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 11:01:01,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:01:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 11:01:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:01:01,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:01,768 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1, 1] [2019-08-05 11:01:01,768 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1255536629, now seen corresponding path program 73 times [2019-08-05 11:01:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:01,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:01:01,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:04,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:04,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:01:04,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:01:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:01:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:01:04,450 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 76 states. [2019-08-05 11:01:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:04,580 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-05 11:01:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:01:04,581 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 78 [2019-08-05 11:01:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:04,582 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:01:04,582 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:01:04,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:01:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:01:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:01:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:01:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-08-05 11:01:04,585 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-08-05 11:01:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:04,586 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-08-05 11:01:04,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:01:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-08-05 11:01:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:01:04,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:04,587 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1, 1] [2019-08-05 11:01:04,587 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash -268840411, now seen corresponding path program 74 times [2019-08-05 11:01:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:04,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:01:04,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:01:07,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:01:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:01:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:01:07,150 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 77 states. [2019-08-05 11:01:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:07,339 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-05 11:01:07,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:01:07,340 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 79 [2019-08-05 11:01:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:07,340 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:01:07,340 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:01:07,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:01:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:01:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:01:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:01:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 11:01:07,344 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-08-05 11:01:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:07,344 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 11:01:07,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:01:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 11:01:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:01:07,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:07,345 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1, 1] [2019-08-05 11:01:07,345 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 253971275, now seen corresponding path program 75 times [2019-08-05 11:01:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:07,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:01:07,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:10,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:10,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:01:10,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:01:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:01:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:01:10,697 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 78 states. [2019-08-05 11:01:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:11,196 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 11:01:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:01:11,197 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 80 [2019-08-05 11:01:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:11,197 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:01:11,198 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:01:11,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:01:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:01:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:01:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:01:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 11:01:11,200 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-05 11:01:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:11,200 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 11:01:11,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:01:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 11:01:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:01:11,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:11,201 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1, 1] [2019-08-05 11:01:11,201 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -718735643, now seen corresponding path program 76 times [2019-08-05 11:01:11,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:11,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:01:11,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:13,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:13,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:01:13,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:01:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:01:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:01:13,862 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 79 states. [2019-08-05 11:01:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:14,027 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 11:01:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:01:14,028 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 81 [2019-08-05 11:01:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:14,028 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:01:14,029 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:01:14,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:01:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:01:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:01:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:01:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 11:01:14,030 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 81 [2019-08-05 11:01:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:14,031 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 11:01:14,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:01:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 11:01:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:01:14,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:14,032 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1, 1] [2019-08-05 11:01:14,032 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -807879029, now seen corresponding path program 77 times [2019-08-05 11:01:14,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:14,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:01:14,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:01:16,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:01:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:01:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:01:16,991 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 80 states. [2019-08-05 11:01:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:17,129 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-08-05 11:01:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:01:17,130 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 82 [2019-08-05 11:01:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:17,130 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:01:17,131 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:01:17,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:01:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:01:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:01:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:01:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-05 11:01:17,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-08-05 11:01:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:17,134 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-05 11:01:17,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:01:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-05 11:01:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:01:17,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:17,135 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1, 1] [2019-08-05 11:01:17,135 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash 723643301, now seen corresponding path program 78 times [2019-08-05 11:01:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:17,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:01:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:20,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:20,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:01:20,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:01:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:01:20,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:01:20,221 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 81 states. [2019-08-05 11:01:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:20,403 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 11:01:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:01:20,403 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 83 [2019-08-05 11:01:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:20,404 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:01:20,404 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:01:20,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:01:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:01:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:01:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:01:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 11:01:20,407 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-08-05 11:01:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:20,407 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 11:01:20,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:01:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 11:01:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:01:20,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:20,408 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1, 1] [2019-08-05 11:01:20,408 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 956195275, now seen corresponding path program 79 times [2019-08-05 11:01:20,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:20,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:01:20,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:01:23,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:01:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:01:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:01:23,594 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 82 states. [2019-08-05 11:01:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:23,792 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-05 11:01:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:01:23,793 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 84 [2019-08-05 11:01:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:23,793 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:01:23,794 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:01:23,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:01:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:01:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:01:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:01:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-05 11:01:23,795 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2019-08-05 11:01:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:23,795 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-05 11:01:23,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:01:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-05 11:01:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:01:23,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,796 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1, 1] [2019-08-05 11:01:23,796 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash -424628123, now seen corresponding path program 80 times [2019-08-05 11:01:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:27,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:01:27,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:01:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:01:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:01:27,003 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 83 states. [2019-08-05 11:01:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:27,182 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 11:01:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:01:27,182 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 85 [2019-08-05 11:01:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:27,183 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:01:27,183 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:01:27,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:01:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:01:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:01:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:01:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 11:01:27,185 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 85 [2019-08-05 11:01:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:27,185 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 11:01:27,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:01:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 11:01:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:01:27,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:27,186 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1, 1] [2019-08-05 11:01:27,186 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -280480501, now seen corresponding path program 81 times [2019-08-05 11:01:27,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:27,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:01:27,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:30,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:30,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:01:30,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:01:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:01:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:01:30,599 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2019-08-05 11:01:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:30,771 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 11:01:30,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:01:30,772 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2019-08-05 11:01:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:30,772 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:01:30,773 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:01:30,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:01:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:01:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:01:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:01:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-05 11:01:30,775 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-05 11:01:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:30,776 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-05 11:01:30,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:01:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-05 11:01:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:01:30,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:30,776 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1, 1] [2019-08-05 11:01:30,776 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -106871515, now seen corresponding path program 82 times [2019-08-05 11:01:30,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:30,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:01:30,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:34,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:01:34,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:01:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:01:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:01:34,200 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 85 states. [2019-08-05 11:01:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:34,388 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 11:01:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:01:34,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 87 [2019-08-05 11:01:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:34,389 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:01:34,389 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:01:34,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:01:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:01:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:01:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:01:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 11:01:34,391 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-08-05 11:01:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:34,392 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 11:01:34,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:01:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 11:01:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:01:34,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:34,393 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1, 1] [2019-08-05 11:01:34,393 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 980039755, now seen corresponding path program 83 times [2019-08-05 11:01:34,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:34,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:01:34,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:37,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:37,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:01:37,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:01:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:01:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:01:37,819 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 86 states. [2019-08-05 11:01:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:38,020 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-08-05 11:01:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:01:38,020 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 88 [2019-08-05 11:01:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:38,021 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:01:38,021 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:01:38,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:01:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:01:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:01:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:01:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 11:01:38,023 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2019-08-05 11:01:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:38,024 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 11:01:38,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:01:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 11:01:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:01:38,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,024 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1, 1] [2019-08-05 11:01:38,024 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash 314550757, now seen corresponding path program 84 times [2019-08-05 11:01:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:38,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:01:38,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:41,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:41,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:01:41,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:01:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:01:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:01:41,536 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 87 states. [2019-08-05 11:01:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:41,677 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 11:01:41,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:01:41,678 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 89 [2019-08-05 11:01:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:41,678 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:01:41,678 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:01:41,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:01:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:01:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:01:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:01:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 11:01:41,680 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-05 11:01:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:41,681 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 11:01:41,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:01:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 11:01:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:01:41,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:41,683 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1, 1] [2019-08-05 11:01:41,683 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1159228299, now seen corresponding path program 85 times [2019-08-05 11:01:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:41,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:01:41,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:45,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:45,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:01:45,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:01:45,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:01:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:01:45,220 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 88 states. [2019-08-05 11:01:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:45,448 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 11:01:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:01:45,449 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 90 [2019-08-05 11:01:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:45,449 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:01:45,449 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:01:45,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:01:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:01:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:01:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:01:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-05 11:01:45,452 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-08-05 11:01:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:45,453 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-05 11:01:45,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:01:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-05 11:01:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:01:45,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:45,454 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1, 1] [2019-08-05 11:01:45,454 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1574428325, now seen corresponding path program 86 times [2019-08-05 11:01:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:45,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:01:45,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:01:48,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:01:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:01:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:01:48,806 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 89 states. [2019-08-05 11:01:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:48,981 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 11:01:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:01:48,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 91 [2019-08-05 11:01:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:48,982 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:01:48,982 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:01:48,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:01:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:01:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:01:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:01:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 11:01:48,984 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-08-05 11:01:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:48,984 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 11:01:48,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:01:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 11:01:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:01:48,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:48,985 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1, 1] [2019-08-05 11:01:48,985 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1560727243, now seen corresponding path program 87 times [2019-08-05 11:01:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:49,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:01:49,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:52,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:01:52,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:01:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:01:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:01:52,809 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 90 states. [2019-08-05 11:01:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:53,010 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 11:01:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:01:53,011 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 92 [2019-08-05 11:01:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:53,012 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:01:53,012 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:01:53,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:01:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:01:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:01:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:01:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 11:01:53,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-05 11:01:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:53,015 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 11:01:53,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:01:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 11:01:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:01:53,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:53,016 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1, 1] [2019-08-05 11:01:53,016 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1135993701, now seen corresponding path program 88 times [2019-08-05 11:01:53,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:53,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:01:53,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:56,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:56,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:01:56,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:01:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:01:56,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:01:56,803 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 91 states. [2019-08-05 11:01:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:56,984 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 11:01:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:01:56,985 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 93 [2019-08-05 11:01:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:56,986 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:01:56,986 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:01:56,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 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 11:01:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:01:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:01:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:01:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 11:01:56,989 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 93 [2019-08-05 11:01:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:56,989 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 11:01:56,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:01:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 11:01:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:01:56,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:56,990 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1, 1] [2019-08-05 11:01:56,990 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 854155787, now seen corresponding path program 89 times [2019-08-05 11:01:56,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:57,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:01:57,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:01,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:01,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:02:01,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:02:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:02:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:02:01,037 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 92 states. [2019-08-05 11:02:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,220 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-08-05 11:02:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:02:01,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 94 [2019-08-05 11:02:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,222 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:02:01,222 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:02:01,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:02:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:02:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:02:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:02:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-05 11:02:01,225 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-08-05 11:02:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,225 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-05 11:02:01,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:02:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-05 11:02:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:02:01,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,227 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1, 1] [2019-08-05 11:02:01,227 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 707115045, now seen corresponding path program 90 times [2019-08-05 11:02:01,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:01,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:02:01,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:04,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:04,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:02:04,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:02:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:02:04,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:02:04,892 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 93 states. [2019-08-05 11:02:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:05,080 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 11:02:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:02:05,081 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 95 [2019-08-05 11:02:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:05,082 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:02:05,082 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:02:05,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:02:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:02:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:02:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:02:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 11:02:05,085 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-08-05 11:02:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:05,085 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 11:02:05,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:02:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 11:02:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:02:05,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:05,086 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1, 1] [2019-08-05 11:02:05,086 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 443819339, now seen corresponding path program 91 times [2019-08-05 11:02:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:09,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:09,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:02:09,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:02:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:02:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:02:09,074 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 94 states. [2019-08-05 11:02:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:09,256 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 11:02:09,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:02:09,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 96 [2019-08-05 11:02:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:09,257 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:02:09,257 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:02:09,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:02:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:02:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:02:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:02:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-08-05 11:02:09,259 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2019-08-05 11:02:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:09,259 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-08-05 11:02:09,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:02:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-08-05 11:02:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:02:09,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:09,260 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1, 1] [2019-08-05 11:02:09,260 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 871587045, now seen corresponding path program 92 times [2019-08-05 11:02:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:09,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:02:09,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:13,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:02:13,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:02:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:02:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:02:13,450 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 95 states. [2019-08-05 11:02:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:13,600 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 11:02:13,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:02:13,601 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 97 [2019-08-05 11:02:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:13,602 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:02:13,602 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:02:13,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:02:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:02:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:02:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:02:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 11:02:13,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 97 [2019-08-05 11:02:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:13,605 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 11:02:13,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:02:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 11:02:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:02:13,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:13,606 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1, 1] [2019-08-05 11:02:13,606 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1247484043, now seen corresponding path program 93 times [2019-08-05 11:02:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:13,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:02:13,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:17,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:17,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:02:17,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:02:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:02:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:02:17,805 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 96 states. [2019-08-05 11:02:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:17,993 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 11:02:17,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:02:17,994 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 98 [2019-08-05 11:02:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:17,995 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:02:17,995 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:02:17,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:02:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:02:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:02:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:02:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-05 11:02:17,998 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-05 11:02:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:17,999 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-05 11:02:17,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:02:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-05 11:02:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:02:17,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:17,999 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1] [2019-08-05 11:02:18,000 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:18,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash 15389093, now seen corresponding path program 94 times [2019-08-05 11:02:18,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:18,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:02:18,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:18,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:18,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:18,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:02:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 11:02:18,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:02:18,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:02:18,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:18,440 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 5 states. [2019-08-05 11:02:18,670 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:02:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:18,706 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 11:02:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:02:18,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-08-05 11:02:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:18,707 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:02:18,707 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:02:18,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:02:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:02:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:02:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 11:02:18,709 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-08-05 11:02:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:18,709 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 11:02:18,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 11:02:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:02:18,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:18,710 INFO L399 BasicCegarLoop]: trace histogram [94, 2, 1, 1, 1, 1, 1] [2019-08-05 11:02:18,711 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1904068767, now seen corresponding path program 1 times [2019-08-05 11:02:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:18,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:02:18,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:18,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:18,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:18,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:02:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 11:02:19,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:19,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:02:19,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:19,176 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 7 states. [2019-08-05 11:02:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:19,337 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-05 11:02:19,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:02:19,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-08-05 11:02:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:19,339 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:02:19,339 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:02:19,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:02:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:02:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:02:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-08-05 11:02:19,343 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-08-05 11:02:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:19,343 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-08-05 11:02:19,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-08-05 11:02:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:02:19,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:19,344 INFO L399 BasicCegarLoop]: trace histogram [94, 3, 2, 1, 1, 1, 1] [2019-08-05 11:02:19,345 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 154069273, now seen corresponding path program 2 times [2019-08-05 11:02:19,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:19,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:02:19,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:19,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:19,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:19,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:19,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:19,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:02:19,921 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:02:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 11:02:19,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:19,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:02:19,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:19,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:19,966 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 7 states. [2019-08-05 11:02:20,418 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-08-05 11:02:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:20,691 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 11:02:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:02:20,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-08-05 11:02:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:20,692 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:02:20,692 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:02:20,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:02:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:02:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:02:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 11:02:20,696 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 103 [2019-08-05 11:02:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:20,696 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 11:02:20,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 11:02:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:02:20,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:20,697 INFO L399 BasicCegarLoop]: trace histogram [94, 4, 3, 1, 1, 1, 1] [2019-08-05 11:02:20,697 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2031735571, now seen corresponding path program 3 times [2019-08-05 11:02:20,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:21,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 11:02:21,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,267 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-08-05 11:02:27,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 50 [2019-08-05 11:02:27,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:27,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:27,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:27,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:49 [2019-08-05 11:02:27,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,563 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:27,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:27,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:27,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 79 treesize of output 161 [2019-08-05 11:02:27,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:27,738 INFO L567 ElimStorePlain]: treesize reduction 50, result has 67.5 percent of original size [2019-08-05 11:02:27,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:27,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:27,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:27,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:27,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:90, output treesize:72 [2019-08-05 11:02:27,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:27,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:02:27,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:27,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:28,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,104 INFO L235 Elim1Store]: Index analysis took 154 ms [2019-08-05 11:02:28,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:28,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 27 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 103 [2019-08-05 11:02:28,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:28,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,330 INFO L235 Elim1Store]: Index analysis took 126 ms [2019-08-05 11:02:28,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:28,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 27 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 103 [2019-08-05 11:02:28,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:28,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,442 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:02:28,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 80 [2019-08-05 11:02:28,519 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,600 INFO L567 ElimStorePlain]: treesize reduction 189, result has 27.3 percent of original size [2019-08-05 11:02:28,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,602 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:208, output treesize:14 [2019-08-05 11:02:28,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:28,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2019-08-05 11:02:28,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:28,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:55, output treesize:14 [2019-08-05 11:02:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4477 backedges. 3 proven. 4474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:28,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:28,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:02:28,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:02:28,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:02:28,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4664, Invalid=5436, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:02:28,867 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 101 states. [2019-08-05 11:02:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:30,643 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-08-05 11:02:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:02:30,643 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 105 [2019-08-05 11:02:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:30,645 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:02:30,645 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:02:30,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4680, Invalid=6240, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:02:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:02:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:02:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:02:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 11:02:30,648 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 105 [2019-08-05 11:02:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:30,648 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 11:02:30,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:02:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 11:02:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:02:30,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:30,649 INFO L399 BasicCegarLoop]: trace histogram [95, 4, 3, 1, 1, 1, 1] [2019-08-05 11:02:30,650 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1509329081, now seen corresponding path program 4 times [2019-08-05 11:02:30,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:30,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:02:30,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:02:36,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:02:36,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2019-08-05 11:02:36,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:02:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:02:36,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:02:36,384 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 97 states. [2019-08-05 11:02:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:36,693 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2019-08-05 11:02:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:02:36,694 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 106 [2019-08-05 11:02:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:36,695 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:02:36,695 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:02:36,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:02:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:02:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:02:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:02:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:02:36,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-08-05 11:02:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:36,696 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:02:36,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:02:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:02:36,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:02:36,702 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:02:36 BoogieIcfgContainer [2019-08-05 11:02:36,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:02:36,703 INFO L168 Benchmark]: Toolchain (without parser) took 190206.98 ms. Allocated memory was 133.7 MB in the beginning and 564.1 MB in the end (delta: 430.4 MB). Free memory was 109.1 MB in the beginning and 280.8 MB in the end (delta: -171.7 MB). Peak memory consumption was 258.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,704 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 110.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.12 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,704 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 105.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,705 INFO L168 Benchmark]: RCFGBuilder took 443.32 ms. Allocated memory is still 133.7 MB. Free memory was 105.5 MB in the beginning and 87.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,705 INFO L168 Benchmark]: TraceAbstraction took 189658.87 ms. Allocated memory was 133.7 MB in the beginning and 564.1 MB in the end (delta: 430.4 MB). Free memory was 87.5 MB in the beginning and 280.8 MB in the end (delta: -193.3 MB). Peak memory consumption was 237.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:02:36,708 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 110.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.12 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 105.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 443.32 ms. Allocated memory is still 133.7 MB. Free memory was 105.5 MB in the beginning and 87.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189658.87 ms. Allocated memory was 133.7 MB in the beginning and 564.1 MB in the end (delta: 430.4 MB). Free memory was 87.5 MB in the beginning and 280.8 MB in the end (delta: -193.3 MB). Peak memory consumption was 237.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 246]: 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, 7 locations, 1 error locations. SAFE Result, 189.5s OverallTime, 99 OverallIterations, 95 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 28 SDslu, 4884 SDs, 0 SdLazy, 6575 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5272 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 4688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 167.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=98, 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.2s AutomataMinimizationTime, 99 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 170.7s InterpolantComputationTime, 5355 NumberOfCodeBlocks, 5355 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 5256 ConstructedInterpolants, 1 QuantifiedInterpolants, 2546966 SizeOfPredicates, 273 NumberOfNonLiveVariables, 29925 ConjunctsInSsa, 4978 ConjunctsInUnsatCore, 99 InterpolantComputations, 3 PerfectInterpolantSequences, 17970/160867 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...