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/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:58,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:58,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:58,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:58,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:58,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:58,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:58,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:58,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:58,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:58,553 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:58,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:58,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:58,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:58,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:58,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:58,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:58,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:58,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:58,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:58,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:58,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:58,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:58,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:58,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:58,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:58,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:58,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:58,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:58,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:58,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:58,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:58,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:58,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:58,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:58,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:58,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:58,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:58,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:58,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:58,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:58,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:58,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:58,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:58,648 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:58,649 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:58,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2019-08-05 11:01:58,649 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl' [2019-08-05 11:01:58,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:58,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:58,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:58,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:58,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:58,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:58,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:58,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:58,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:58,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... [2019-08-05 11:01:58,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:58,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:58,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:58,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:58,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:58,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:58,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:58,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:59,157 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:59,157 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:59,159 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:59 BoogieIcfgContainer [2019-08-05 11:01:59,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:59,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:59,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:59,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:59,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:58" (1/2) ... [2019-08-05 11:01:59,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffd169c and model type ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:59, skipping insertion in model container [2019-08-05 11:01:59,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:59" (2/2) ... [2019-08-05 11:01:59,168 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2019-08-05 11:01:59,186 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:59,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:59,214 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:59,249 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:59,250 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:59,250 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:59,250 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:59,251 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:59,251 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:59,251 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:59,251 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:59,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:01:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:01:59,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:59,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:01:59,286 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 28697802, now seen corresponding path program 1 times [2019-08-05 11:01:59,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:59,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:01:59,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:59,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:59,465 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:01:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:59,552 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 11:01:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:59,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:01:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:59,564 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:01:59,565 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:01:59,567 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 11:01:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:01:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:01:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:01:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:01:59,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:01:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:59,599 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:01:59,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:01:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:01:59,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:59,600 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:01:59,601 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1808836260, now seen corresponding path program 1 times [2019-08-05 11:01:59,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:59,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:01:59,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:01:59,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:59,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:59,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:59,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:59,858 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2019-08-05 11:02:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:00,051 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:02:00,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:00,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:02:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:00,053 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:02:00,053 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:02:00,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:02:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:02:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:02:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 11:02:00,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-08-05 11:02:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:00,058 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 11:02:00,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:02:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 11:02:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:02:00,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:00,059 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:02:00,059 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 977724265, now seen corresponding path program 1 times [2019-08-05 11:02:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:00,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:02:00,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:02:00,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:02:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:02:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:00,264 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2019-08-05 11:02:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:00,627 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:02:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:02:00,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:02:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:00,629 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:02:00,629 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:02:00,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:02:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:02:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:02:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 11:02:00,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2019-08-05 11:02:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:00,637 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 11:02:00,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:02:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 11:02:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:02:00,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:00,638 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:02:00,638 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1143014126, now seen corresponding path program 2 times [2019-08-05 11:02:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:00,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:02:00,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:02:00,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:02:00,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:00,795 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2019-08-05 11:02:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:00,856 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:02:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:00,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:02:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:00,858 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:02:00,858 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:02:00,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:02:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:02:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:02:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:02:00,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-08-05 11:02:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:00,862 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:02:00,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:02:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:02:00,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:00,865 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-08-05 11:02:00,865 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1360430456, now seen corresponding path program 3 times [2019-08-05 11:02:00,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:00,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:02:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:02:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:00,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:02:00,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:02:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:02:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:01,000 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-08-05 11:02:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,116 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:02:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:02:01,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:02:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,118 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:02:01,118 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:02:01,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:02:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:02:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:02:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:02:01,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-05 11:02:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,122 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:02:01,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:02:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:02:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:02:01,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,123 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1] [2019-08-05 11:02:01,123 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1703557918, now seen corresponding path program 4 times [2019-08-05 11:02:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:01,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:02:01,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:02:01,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:01,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:02:01,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:02:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:02:01,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:01,329 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-05 11:02:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,794 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-08-05 11:02:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:02:01,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 11:02:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,795 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:02:01,795 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:02:01,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:02:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:02:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:02:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-08-05 11:02:01,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2019-08-05 11:02:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,800 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-08-05 11:02:01,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:02:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-08-05 11:02:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:02:01,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,801 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1] [2019-08-05 11:02:01,801 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1033090879, now seen corresponding path program 5 times [2019-08-05 11:02:01,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:01,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:02:01,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 11:02:02,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:02,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:02:02,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:02,047 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 7 states. [2019-08-05 11:02:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:02,154 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:02:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:02:02,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:02:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:02,157 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:02:02,157 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:02:02,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:02:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:02:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:02:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:02:02,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-08-05 11:02:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:02,161 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:02:02,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:02:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:02:02,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:02,162 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 1, 1, 1] [2019-08-05 11:02:02,163 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash -83236965, now seen corresponding path program 6 times [2019-08-05 11:02:02,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:02,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:02:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-08-05 11:02:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:02:02,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:02,288 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2019-08-05 11:02:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:02,342 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-08-05 11:02:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:02,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 11:02:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:02,344 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:02:02,344 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:02:02,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:02:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:02:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:02:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 11:02:02,349 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-05 11:02:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:02,350 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 11:02:02,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 11:02:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:02:02,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:02,351 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1] [2019-08-05 11:02:02,351 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1613707573, now seen corresponding path program 7 times [2019-08-05 11:02:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:02,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:02:02,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:02:02,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:02,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:02:02,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:02:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:02:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:02:02,645 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 10 states. [2019-08-05 11:02:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:03,010 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-08-05 11:02:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:02:03,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-08-05 11:02:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:03,012 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:02:03,012 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:02:03,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:02:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-05 11:02:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:02:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-08-05 11:02:03,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 23 [2019-08-05 11:02:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:03,018 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-08-05 11:02:03,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:02:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-08-05 11:02:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:02:03,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:03,019 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1] [2019-08-05 11:02:03,019 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 687182574, now seen corresponding path program 8 times [2019-08-05 11:02:03,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:03,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:02:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 79 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-08-05 11:02:03,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:03,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:02:03,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:02:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:02:03,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:03,190 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2019-08-05 11:02:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:03,306 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 11:02:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:02:03,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 11:02:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:03,308 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:02:03,308 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:02:03,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:02:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:02:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:02:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:02:03,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-08-05 11:02:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:03,313 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:02:03,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:02:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:02:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:02:03,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:03,314 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1] [2019-08-05 11:02:03,314 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:03,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:03,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1902422664, now seen corresponding path program 9 times [2019-08-05 11:02:03,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:03,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:02:03,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-08-05 11:02:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:03,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:02:03,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:02:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:02:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:03,722 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2019-08-05 11:02:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:03,823 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-08-05 11:02:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:02:03,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-08-05 11:02:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:03,825 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:02:03,825 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:02:03,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:02:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:02:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:02:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-08-05 11:02:03,830 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2019-08-05 11:02:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:03,831 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-08-05 11:02:03,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:02:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-08-05 11:02:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:02:03,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:03,832 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 1, 1, 1] [2019-08-05 11:02:03,832 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1427835678, now seen corresponding path program 10 times [2019-08-05 11:02:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:03,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:02:03,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 130 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:02:04,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:04,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:02:04,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:02:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:02:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:04,055 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2019-08-05 11:02:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:04,493 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-08-05 11:02:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:02:04,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 11:02:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:04,498 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:02:04,498 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:02:04,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:02:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-08-05 11:02:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:02:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-08-05 11:02:04,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 33 [2019-08-05 11:02:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:04,507 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-08-05 11:02:04,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:02:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-08-05 11:02:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:02:04,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:04,512 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 6, 5, 1, 1, 1] [2019-08-05 11:02:04,513 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1226368395, now seen corresponding path program 11 times [2019-08-05 11:02:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:04,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:02:04,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 176 proven. 67 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:02:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:04,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:02:04,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:02:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:02:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:04,874 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 11 states. [2019-08-05 11:02:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:05,159 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 11:02:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:02:05,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-08-05 11:02:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:05,161 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:02:05,161 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:02:05,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:02:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:02:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:02:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 11:02:05,167 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-08-05 11:02:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:05,167 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 11:02:05,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:02:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 11:02:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:02:05,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:05,169 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 6, 5, 1, 1, 1] [2019-08-05 11:02:05,169 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2072396721, now seen corresponding path program 12 times [2019-08-05 11:02:05,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 125 proven. 20 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 11:02:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:05,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:02:05,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:05,709 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 7 states. [2019-08-05 11:02:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:05,835 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-08-05 11:02:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:02:05,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-08-05 11:02:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:05,843 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:02:05,843 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:02:05,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:02:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:02:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:02:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:02:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-08-05 11:02:05,848 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-08-05 11:02:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:05,848 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-08-05 11:02:05,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-08-05 11:02:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:02:05,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:05,850 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 6, 5, 1, 1, 1] [2019-08-05 11:02:05,850 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1291628777, now seen corresponding path program 13 times [2019-08-05 11:02:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 40 proven. 275 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:02:07,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:07,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:02:07,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:02:07,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:02:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:07,047 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2019-08-05 11:02:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:07,534 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-08-05 11:02:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:02:07,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:02:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:07,535 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:02:07,535 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:02:07,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:02:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-08-05 11:02:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:02:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-08-05 11:02:07,541 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2019-08-05 11:02:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:07,541 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-08-05 11:02:07,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:02:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-08-05 11:02:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:02:07,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:07,542 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 7, 6, 1, 1, 1] [2019-08-05 11:02:07,543 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -798442282, now seen corresponding path program 14 times [2019-08-05 11:02:07,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:07,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:07,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 345 proven. 131 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:02:08,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:02:08,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:02:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:02:08,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:08,353 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2019-08-05 11:02:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:08,623 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 11:02:08,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:02:08,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-08-05 11:02:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:08,624 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:02:08,625 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:02:08,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:02:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:02:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:02:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 11:02:08,629 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 55 [2019-08-05 11:02:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:08,630 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 11:02:08,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:02:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 11:02:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:02:08,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:08,631 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 7, 6, 1, 1, 1] [2019-08-05 11:02:08,631 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1122998896, now seen corresponding path program 15 times [2019-08-05 11:02:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 216 proven. 30 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-08-05 11:02:08,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:02:08,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:02:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:02:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:08,821 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 8 states. [2019-08-05 11:02:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:08,914 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-08-05 11:02:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:02:08,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-08-05 11:02:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:08,915 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:02:08,915 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:02:08,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:02:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:02:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:02:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-08-05 11:02:08,921 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2019-08-05 11:02:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:08,922 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-08-05 11:02:08,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:02:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-08-05 11:02:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:02:08,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:08,923 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 7, 6, 1, 1, 1] [2019-08-05 11:02:08,923 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1165200074, now seen corresponding path program 16 times [2019-08-05 11:02:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 57 proven. 518 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:02:09,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:09,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:02:09,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:02:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:02:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:09,355 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-08-05 11:02:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:10,090 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-08-05 11:02:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:02:10,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-08-05 11:02:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:10,092 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:02:10,092 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:02:10,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:02:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:02:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-08-05 11:02:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:02:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-08-05 11:02:10,098 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 59 [2019-08-05 11:02:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:10,099 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-08-05 11:02:10,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:02:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-08-05 11:02:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:02:10,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:10,100 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 8, 7, 1, 1, 1] [2019-08-05 11:02:10,100 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:10,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:10,101 INFO L82 PathProgramCache]: Analyzing trace with hash 38779921, now seen corresponding path program 17 times [2019-08-05 11:02:10,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:10,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:02:10,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 617 proven. 226 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-08-05 11:02:10,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:10,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:02:10,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:02:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:02:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:10,597 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 15 states. [2019-08-05 11:02:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:10,864 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 11:02:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:02:10,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-08-05 11:02:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:10,865 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:02:10,865 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:02:10,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:02:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:02:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:02:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-08-05 11:02:10,872 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-08-05 11:02:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:10,872 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-08-05 11:02:10,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:02:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-08-05 11:02:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:02:10,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:10,873 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 8, 7, 1, 1, 1] [2019-08-05 11:02:10,874 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 777193195, now seen corresponding path program 18 times [2019-08-05 11:02:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:10,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:02:10,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 343 proven. 42 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-08-05 11:02:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:02:11,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:02:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:02:11,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:11,031 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 9 states. [2019-08-05 11:02:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:11,141 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-08-05 11:02:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:02:11,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-08-05 11:02:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:11,142 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:02:11,143 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:02:11,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:02:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:02:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:02:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-08-05 11:02:11,147 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2019-08-05 11:02:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:11,148 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-08-05 11:02:11,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:02:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-08-05 11:02:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:02:11,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:11,149 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 8, 7, 1, 1, 1] [2019-08-05 11:02:11,149 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -441596795, now seen corresponding path program 19 times [2019-08-05 11:02:11,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:11,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:02:11,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 77 proven. 896 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:02:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:02:11,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:02:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:02:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:11,548 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 18 states. [2019-08-05 11:02:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:12,259 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-08-05 11:02:12,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:02:12,260 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2019-08-05 11:02:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:12,261 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:02:12,261 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:02:12,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=695, Invalid=2167, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:02:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:02:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-08-05 11:02:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:02:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-08-05 11:02:12,268 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 75 [2019-08-05 11:02:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:12,268 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-08-05 11:02:12,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:02:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-08-05 11:02:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:02:12,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:12,270 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 9, 8, 1, 1, 1] [2019-08-05 11:02:12,270 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash -570761562, now seen corresponding path program 20 times [2019-08-05 11:02:12,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:12,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:02:12,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1029 proven. 358 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-08-05 11:02:12,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:12,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:02:12,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:02:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:02:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:12,692 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 17 states. [2019-08-05 11:02:13,103 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:02:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:13,498 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 11:02:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:02:13,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-08-05 11:02:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:13,500 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:02:13,501 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:02:13,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:02:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:02:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:02:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-08-05 11:02:13,504 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 89 [2019-08-05 11:02:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:13,504 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-08-05 11:02:13,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:02:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-08-05 11:02:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:02:13,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:13,506 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 9, 8, 1, 1, 1] [2019-08-05 11:02:13,506 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:13,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1872025536, now seen corresponding path program 21 times [2019-08-05 11:02:13,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:13,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:02:13,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 512 proven. 56 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2019-08-05 11:02:14,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:14,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:02:14,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:02:14,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:02:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:02:14,106 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 10 states. [2019-08-05 11:02:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:14,266 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-08-05 11:02:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:02:14,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-08-05 11:02:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:14,268 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:02:14,269 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:02:14,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:02:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:02:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:02:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-08-05 11:02:14,272 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2019-08-05 11:02:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:14,273 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-08-05 11:02:14,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:02:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-08-05 11:02:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:02:14,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:14,274 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 9, 8, 1, 1, 1] [2019-08-05 11:02:14,275 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 574809242, now seen corresponding path program 22 times [2019-08-05 11:02:14,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 100 proven. 1452 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-08-05 11:02:15,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:15,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:02:15,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:02:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:02:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:15,553 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 20 states. [2019-08-05 11:02:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:16,483 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-08-05 11:02:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:02:16,484 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 93 [2019-08-05 11:02:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:16,485 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:02:16,486 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:02:16,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=979, Invalid=3181, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:02:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:02:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-08-05 11:02:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:02:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-08-05 11:02:16,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 93 [2019-08-05 11:02:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:16,491 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-08-05 11:02:16,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:02:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-08-05 11:02:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:02:16,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:16,492 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 10, 9, 1, 1, 1] [2019-08-05 11:02:16,493 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1761415275, now seen corresponding path program 23 times [2019-08-05 11:02:16,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:16,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:02:16,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 1624 proven. 533 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-08-05 11:02:16,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:16,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:02:16,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:02:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:02:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:02:16,957 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 19 states. [2019-08-05 11:02:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:17,275 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 11:02:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:02:17,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-08-05 11:02:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:17,277 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:02:17,277 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:02:17,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:02:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:02:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:02:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-05 11:02:17,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-08-05 11:02:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:17,281 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-05 11:02:17,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:02:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-05 11:02:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:02:17,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:17,282 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 10, 9, 1, 1, 1] [2019-08-05 11:02:17,282 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1858734447, now seen corresponding path program 24 times [2019-08-05 11:02:17,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:17,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:02:17,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 729 proven. 72 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2019-08-05 11:02:17,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:17,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:02:17,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:02:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:02:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:17,609 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 11 states. [2019-08-05 11:02:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:17,766 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-08-05 11:02:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:02:17,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2019-08-05 11:02:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:17,767 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:02:17,767 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:02:17,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:02:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:02:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:02:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-08-05 11:02:17,771 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2019-08-05 11:02:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:17,771 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-08-05 11:02:17,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:02:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-08-05 11:02:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:02:17,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:17,772 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 10, 9, 1, 1, 1] [2019-08-05 11:02:17,772 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash -462539255, now seen corresponding path program 25 times [2019-08-05 11:02:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:17,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:02:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 126 proven. 2235 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:02:18,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:18,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:02:18,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:02:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:02:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:18,820 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 22 states. [2019-08-05 11:02:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:19,942 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-08-05 11:02:19,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:02:19,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-08-05 11:02:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:19,944 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:02:19,944 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:02:19,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1341, Invalid=4511, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:02:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:02:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 11:02:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:02:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2019-08-05 11:02:19,949 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 113 [2019-08-05 11:02:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:19,950 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2019-08-05 11:02:19,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:02:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2019-08-05 11:02:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:02:19,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:19,951 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 11, 10, 1, 1, 1] [2019-08-05 11:02:19,951 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1522557346, now seen corresponding path program 26 times [2019-08-05 11:02:19,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:20,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:02:20,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 2451 proven. 757 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-08-05 11:02:20,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:20,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:02:20,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:02:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:02:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:20,371 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 21 states. [2019-08-05 11:02:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:20,791 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-05 11:02:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:02:20,791 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 131 [2019-08-05 11:02:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:20,793 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:02:20,793 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:02:20,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=561, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:02:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:02:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 11:02:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:02:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-08-05 11:02:20,797 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-08-05 11:02:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:20,797 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-08-05 11:02:20,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:02:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-08-05 11:02:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:02:20,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:20,799 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 11, 10, 1, 1, 1] [2019-08-05 11:02:20,799 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1088849416, now seen corresponding path program 27 times [2019-08-05 11:02:20,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:20,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:02:20,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 1000 proven. 90 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2019-08-05 11:02:21,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:21,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:02:21,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:02:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:02:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:21,054 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 12 states. [2019-08-05 11:02:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:21,240 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-08-05 11:02:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:02:21,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2019-08-05 11:02:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:21,242 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:02:21,243 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:02:21,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:02:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:02:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:02:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-08-05 11:02:21,247 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2019-08-05 11:02:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:21,247 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-08-05 11:02:21,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:02:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-08-05 11:02:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:02:21,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:21,248 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 11, 10, 1, 1, 1] [2019-08-05 11:02:21,249 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1587783762, now seen corresponding path program 28 times [2019-08-05 11:02:21,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:21,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:02:21,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 155 proven. 3300 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-08-05 11:02:21,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:21,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:02:21,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:02:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:02:21,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:21,734 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 24 states. [2019-08-05 11:02:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:23,023 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-08-05 11:02:23,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:02:23,023 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2019-08-05 11:02:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:23,025 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:02:23,025 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:02:23,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1794, Invalid=6216, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:02:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:02:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-08-05 11:02:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:02:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2019-08-05 11:02:23,032 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 135 [2019-08-05 11:02:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:23,032 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2019-08-05 11:02:23,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:02:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2019-08-05 11:02:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:02:23,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:23,033 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 12, 11, 1, 1, 1] [2019-08-05 11:02:23,033 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1450753793, now seen corresponding path program 29 times [2019-08-05 11:02:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:23,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:02:23,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4996 backedges. 3565 proven. 1036 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-08-05 11:02:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:02:23,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:02:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:02:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:02:23,674 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 23 states. [2019-08-05 11:02:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:24,028 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 11:02:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:02:24,028 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 155 [2019-08-05 11:02:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:24,030 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:02:24,030 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:02:24,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=683, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:02:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 11:02:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:02:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-08-05 11:02:24,034 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-08-05 11:02:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:24,034 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-08-05 11:02:24,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:02:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-08-05 11:02:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:02:24,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:24,035 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 12, 11, 1, 1, 1] [2019-08-05 11:02:24,036 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1367100891, now seen corresponding path program 30 times [2019-08-05 11:02:24,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:24,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:24,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5137 backedges. 1331 proven. 110 refuted. 0 times theorem prover too weak. 3696 trivial. 0 not checked. [2019-08-05 11:02:24,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:24,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:02:24,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:02:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:02:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:24,327 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 13 states. [2019-08-05 11:02:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:24,504 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2019-08-05 11:02:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:02:24,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-08-05 11:02:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:24,506 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:02:24,506 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:02:24,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:02:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:02:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:02:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2019-08-05 11:02:24,510 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2019-08-05 11:02:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:24,511 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2019-08-05 11:02:24,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:02:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2019-08-05 11:02:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:02:24,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:24,512 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 12, 11, 1, 1, 1] [2019-08-05 11:02:24,512 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -475984011, now seen corresponding path program 31 times [2019-08-05 11:02:24,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:24,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:02:24,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5280 backedges. 187 proven. 4708 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 11:02:25,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:02:25,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:02:25,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:02:25,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:02:25,047 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 26 states. [2019-08-05 11:02:25,257 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 11:02:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:27,184 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2019-08-05 11:02:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:02:27,185 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 159 [2019-08-05 11:02:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:27,186 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:02:27,186 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:02:27,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2352, Invalid=8360, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:02:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:02:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-08-05 11:02:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:02:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2019-08-05 11:02:27,195 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 159 [2019-08-05 11:02:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:27,195 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2019-08-05 11:02:27,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:02:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2019-08-05 11:02:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:02:27,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:27,196 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 13, 12, 1, 1, 1] [2019-08-05 11:02:27,196 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1376523778, now seen corresponding path program 32 times [2019-08-05 11:02:27,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:27,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:02:27,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6920 backedges. 5027 proven. 1376 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-05 11:02:27,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:02:27,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:02:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:02:27,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:02:27,792 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 25 states. [2019-08-05 11:02:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:28,145 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2019-08-05 11:02:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:02:28,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2019-08-05 11:02:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:28,148 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:02:28,148 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:02:28,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=443, Invalid=817, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:02:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 11:02:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:02:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-08-05 11:02:28,152 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-08-05 11:02:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:28,153 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-08-05 11:02:28,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:02:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-08-05 11:02:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:02:28,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:28,154 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 13, 12, 1, 1, 1] [2019-08-05 11:02:28,154 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 53738904, now seen corresponding path program 33 times [2019-08-05 11:02:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7086 backedges. 1728 proven. 132 refuted. 0 times theorem prover too weak. 5226 trivial. 0 not checked. [2019-08-05 11:02:28,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:28,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:02:28,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:02:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:02:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:28,454 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 14 states. [2019-08-05 11:02:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:28,725 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2019-08-05 11:02:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:02:28,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2019-08-05 11:02:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:28,728 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:02:28,728 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:02:28,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:02:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:02:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:02:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-08-05 11:02:28,733 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2019-08-05 11:02:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:28,734 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-08-05 11:02:28,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:02:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-08-05 11:02:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:02:28,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:28,735 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 13, 12, 1, 1, 1] [2019-08-05 11:02:28,735 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 103531506, now seen corresponding path program 34 times [2019-08-05 11:02:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7254 backedges. 222 proven. 6526 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-08-05 11:02:29,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:29,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:02:29,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:02:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:02:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:02:29,244 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 28 states. [2019-08-05 11:02:31,943 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 11:02:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:33,617 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-08-05 11:02:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:02:33,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 185 [2019-08-05 11:02:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:33,620 INFO L225 Difference]: With dead ends: 214 [2019-08-05 11:02:33,620 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 11:02:33,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5438 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3030, Invalid=11012, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:02:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 11:02:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-08-05 11:02:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:02:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2019-08-05 11:02:33,627 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 185 [2019-08-05 11:02:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:33,628 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2019-08-05 11:02:33,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:02:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2019-08-05 11:02:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:02:33,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:33,629 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 14, 13, 1, 1, 1] [2019-08-05 11:02:33,629 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:33,630 INFO L82 PathProgramCache]: Analyzing trace with hash 652639317, now seen corresponding path program 35 times [2019-08-05 11:02:33,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:33,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 2173 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:02:33,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9349 backedges. 6904 proven. 1783 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-08-05 11:02:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:34,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:02:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:02:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:02:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:34,396 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand 27 states. [2019-08-05 11:02:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:34,767 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-08-05 11:02:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:02:34,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 209 [2019-08-05 11:02:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:34,769 INFO L225 Difference]: With dead ends: 212 [2019-08-05 11:02:34,770 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 11:02:34,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=963, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:02:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 11:02:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 11:02:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:02:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-08-05 11:02:34,774 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-08-05 11:02:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:34,775 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-08-05 11:02:34,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:02:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-08-05 11:02:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:02:34,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:34,776 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 14, 13, 1, 1, 1] [2019-08-05 11:02:34,776 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1399675345, now seen corresponding path program 36 times [2019-08-05 11:02:34,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:34,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 2191 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:02:34,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9542 backedges. 2197 proven. 156 refuted. 0 times theorem prover too weak. 7189 trivial. 0 not checked. [2019-08-05 11:02:35,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:35,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:02:35,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:02:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:02:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:35,558 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 15 states. [2019-08-05 11:02:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:35,881 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2019-08-05 11:02:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:02:35,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 211 [2019-08-05 11:02:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:35,882 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:02:35,882 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:02:35,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:02:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:02:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:02:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:02:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2019-08-05 11:02:35,886 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2019-08-05 11:02:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:35,887 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2019-08-05 11:02:35,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:02:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2019-08-05 11:02:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:02:35,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:35,888 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 14, 13, 1, 1, 1] [2019-08-05 11:02:35,888 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash -763190583, now seen corresponding path program 37 times [2019-08-05 11:02:35,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:36,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 2209 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:02:36,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9737 backedges. 260 proven. 8827 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-08-05 11:02:36,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:36,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:02:36,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:02:36,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:02:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:02:36,537 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 30 states. [2019-08-05 11:02:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:38,823 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-08-05 11:02:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:02:38,824 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 213 [2019-08-05 11:02:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:38,826 INFO L225 Difference]: With dead ends: 244 [2019-08-05 11:02:38,826 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 11:02:38,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7228 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3844, Invalid=14246, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 11:02:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 11:02:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-08-05 11:02:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:02:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 245 transitions. [2019-08-05 11:02:38,832 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 245 transitions. Word has length 213 [2019-08-05 11:02:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:38,833 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 245 transitions. [2019-08-05 11:02:38,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:02:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 245 transitions. [2019-08-05 11:02:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-08-05 11:02:38,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:38,834 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 15, 14, 1, 1, 1] [2019-08-05 11:02:38,835 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash -475269242, now seen corresponding path program 38 times [2019-08-05 11:02:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:39,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 2465 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:02:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12364 backedges. 9269 proven. 2263 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-08-05 11:02:39,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:02:39,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:02:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:02:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:02:39,474 INFO L87 Difference]: Start difference. First operand 242 states and 245 transitions. Second operand 29 states. [2019-08-05 11:02:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:39,984 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2019-08-05 11:02:39,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:02:39,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 239 [2019-08-05 11:02:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:39,986 INFO L225 Difference]: With dead ends: 242 [2019-08-05 11:02:39,987 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 11:02:39,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=601, Invalid=1121, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:02:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 11:02:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-08-05 11:02:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:02:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-08-05 11:02:39,991 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 239 [2019-08-05 11:02:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:39,992 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-08-05 11:02:39,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:02:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-08-05 11:02:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-05 11:02:39,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:39,993 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 15, 14, 1, 1, 1] [2019-08-05 11:02:39,994 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:39,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1545169184, now seen corresponding path program 39 times [2019-08-05 11:02:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:40,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:02:40,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12586 backedges. 2744 proven. 182 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-08-05 11:02:40,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:40,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:02:40,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:02:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:02:40,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:40,448 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 16 states. [2019-08-05 11:02:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:40,795 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-08-05 11:02:40,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:02:40,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 241 [2019-08-05 11:02:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:40,797 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:02:40,797 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:02:40,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=469, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:02:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:02:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-08-05 11:02:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 11:02:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 246 transitions. [2019-08-05 11:02:40,803 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 246 transitions. Word has length 241 [2019-08-05 11:02:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:40,803 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 246 transitions. [2019-08-05 11:02:40,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:02:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 246 transitions. [2019-08-05 11:02:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 11:02:40,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:40,805 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 15, 14, 1, 1, 1] [2019-08-05 11:02:40,805 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1151046278, now seen corresponding path program 40 times [2019-08-05 11:02:40,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:41,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:02:41,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12810 backedges. 301 proven. 11690 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-08-05 11:02:42,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:42,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:02:42,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:02:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:02:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:02:42,556 INFO L87 Difference]: Start difference. First operand 244 states and 246 transitions. Second operand 32 states. [2019-08-05 11:02:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:45,255 INFO L93 Difference]: Finished difference Result 276 states and 279 transitions. [2019-08-05 11:02:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-08-05 11:02:45,255 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 243 [2019-08-05 11:02:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:45,258 INFO L225 Difference]: With dead ends: 276 [2019-08-05 11:02:45,258 INFO L226 Difference]: Without dead ends: 276 [2019-08-05 11:02:45,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9429 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4811, Invalid=18141, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 11:02:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-08-05 11:02:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2019-08-05 11:02:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:02:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2019-08-05 11:02:45,265 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 243 [2019-08-05 11:02:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:45,265 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2019-08-05 11:02:45,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:02:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2019-08-05 11:02:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 11:02:45,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:45,267 INFO L399 BasicCegarLoop]: trace histogram [119, 118, 16, 15, 1, 1, 1] [2019-08-05 11:02:45,267 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash 7913873, now seen corresponding path program 41 times [2019-08-05 11:02:45,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:45,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:02:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16052 backedges. 12201 proven. 2822 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2019-08-05 11:02:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:02:46,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:02:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:02:46,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:02:46,886 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand 31 states. [2019-08-05 11:02:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:47,581 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2019-08-05 11:02:47,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:47,582 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 271 [2019-08-05 11:02:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:47,583 INFO L225 Difference]: With dead ends: 274 [2019-08-05 11:02:47,584 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 11:02:47,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=689, Invalid=1291, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:02:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 11:02:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-08-05 11:02:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:02:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-08-05 11:02:47,588 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 271 [2019-08-05 11:02:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:47,588 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-08-05 11:02:47,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:02:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-08-05 11:02:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-08-05 11:02:47,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:47,590 INFO L399 BasicCegarLoop]: trace histogram [120, 119, 16, 15, 1, 1, 1] [2019-08-05 11:02:47,590 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -948229013, now seen corresponding path program 42 times [2019-08-05 11:02:47,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:47,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:02:47,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16305 backedges. 3375 proven. 210 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2019-08-05 11:02:48,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:02:48,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:02:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:02:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:48,029 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 17 states. [2019-08-05 11:02:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:48,385 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-08-05 11:02:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:02:48,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 273 [2019-08-05 11:02:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:48,387 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:02:48,387 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:02:48,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:02:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:02:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-08-05 11:02:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 11:02:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-08-05 11:02:48,392 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 273 [2019-08-05 11:02:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:48,392 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-08-05 11:02:48,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:02:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-08-05 11:02:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-08-05 11:02:48,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,394 INFO L399 BasicCegarLoop]: trace histogram [121, 120, 16, 15, 1, 1, 1] [2019-08-05 11:02:48,394 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash -714962427, now seen corresponding path program 43 times [2019-08-05 11:02:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:48,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 2811 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:02:48,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16560 backedges. 345 proven. 15200 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-08-05 11:02:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:02:49,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:02:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:02:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:02:49,146 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 34 states. [2019-08-05 11:02:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:52,499 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-08-05 11:02:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-08-05 11:02:52,499 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 275 [2019-08-05 11:02:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:52,501 INFO L225 Difference]: With dead ends: 310 [2019-08-05 11:02:52,502 INFO L226 Difference]: Without dead ends: 310 [2019-08-05 11:02:52,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5949, Invalid=22781, Unknown=0, NotChecked=0, Total=28730 [2019-08-05 11:02:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-08-05 11:02:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-08-05 11:02:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:02:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 311 transitions. [2019-08-05 11:02:52,509 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 311 transitions. Word has length 275 [2019-08-05 11:02:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:52,510 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 311 transitions. [2019-08-05 11:02:52,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:02:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 311 transitions. [2019-08-05 11:02:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-08-05 11:02:52,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:52,512 INFO L399 BasicCegarLoop]: trace histogram [135, 134, 17, 16, 1, 1, 1] [2019-08-05 11:02:52,512 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1625733898, now seen corresponding path program 44 times [2019-08-05 11:02:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:52,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 3103 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:02:52,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20506 backedges. 15785 proven. 3466 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-08-05 11:02:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:02:53,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:02:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:02:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:53,336 INFO L87 Difference]: Start difference. First operand 308 states and 311 transitions. Second operand 33 states. [2019-08-05 11:02:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:54,104 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2019-08-05 11:02:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:02:54,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 305 [2019-08-05 11:02:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:54,107 INFO L225 Difference]: With dead ends: 308 [2019-08-05 11:02:54,107 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 11:02:54,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=783, Invalid=1473, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:02:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 11:02:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-08-05 11:02:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:02:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2019-08-05 11:02:54,112 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 305 [2019-08-05 11:02:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:54,112 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2019-08-05 11:02:54,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:02:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2019-08-05 11:02:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-08-05 11:02:54,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:54,114 INFO L399 BasicCegarLoop]: trace histogram [136, 135, 17, 16, 1, 1, 1] [2019-08-05 11:02:54,114 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1679014544, now seen corresponding path program 45 times [2019-08-05 11:02:54,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:54,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 3121 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:02:54,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 20792 backedges. 4096 proven. 240 refuted. 0 times theorem prover too weak. 16456 trivial. 0 not checked. [2019-08-05 11:02:54,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:54,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:02:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:02:54,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:02:54,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:54,639 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 18 states. [2019-08-05 11:02:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:55,037 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2019-08-05 11:02:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:02:55,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 307 [2019-08-05 11:02:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:55,039 INFO L225 Difference]: With dead ends: 311 [2019-08-05 11:02:55,039 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 11:02:55,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:02:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 11:02:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2019-08-05 11:02:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-08-05 11:02:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2019-08-05 11:02:55,044 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 307 [2019-08-05 11:02:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:55,045 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 312 transitions. [2019-08-05 11:02:55,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:02:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 312 transitions. [2019-08-05 11:02:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-08-05 11:02:55,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:55,047 INFO L399 BasicCegarLoop]: trace histogram [137, 136, 17, 16, 1, 1, 1] [2019-08-05 11:02:55,047 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1374674198, now seen corresponding path program 46 times [2019-08-05 11:02:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:55,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 3139 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:02:55,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21080 backedges. 392 proven. 19448 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-08-05 11:02:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:02:55,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:02:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:02:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:55,893 INFO L87 Difference]: Start difference. First operand 310 states and 312 transitions. Second operand 36 states. [2019-08-05 11:02:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:59,791 INFO L93 Difference]: Finished difference Result 346 states and 349 transitions. [2019-08-05 11:02:59,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-08-05 11:02:59,791 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 309 [2019-08-05 11:02:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:59,794 INFO L225 Difference]: With dead ends: 346 [2019-08-05 11:02:59,794 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 11:02:59,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15304 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7277, Invalid=28255, Unknown=0, NotChecked=0, Total=35532 [2019-08-05 11:02:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 11:02:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-08-05 11:02:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:02:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 347 transitions. [2019-08-05 11:02:59,802 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 347 transitions. Word has length 309 [2019-08-05 11:02:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:59,802 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 347 transitions. [2019-08-05 11:02:59,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:02:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 347 transitions. [2019-08-05 11:02:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-08-05 11:02:59,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:59,804 INFO L399 BasicCegarLoop]: trace histogram [152, 151, 18, 17, 1, 1, 1] [2019-08-05 11:02:59,805 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -869961547, now seen corresponding path program 47 times [2019-08-05 11:02:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:00,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:00,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25825 backedges. 20112 proven. 4201 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-08-05 11:03:00,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:00,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:03:00,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:03:00,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:03:00,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:03:00,886 INFO L87 Difference]: Start difference. First operand 344 states and 347 transitions. Second operand 35 states. [2019-08-05 11:03:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:01,882 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2019-08-05 11:03:01,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:03:01,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 341 [2019-08-05 11:03:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:01,885 INFO L225 Difference]: With dead ends: 344 [2019-08-05 11:03:01,885 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 11:03:01,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=883, Invalid=1667, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:03:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 11:03:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-08-05 11:03:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:03:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-08-05 11:03:01,890 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 341 [2019-08-05 11:03:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:01,891 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-08-05 11:03:01,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:03:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-08-05 11:03:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-08-05 11:03:01,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:01,893 INFO L399 BasicCegarLoop]: trace histogram [153, 152, 18, 17, 1, 1, 1] [2019-08-05 11:03:01,893 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash -851754353, now seen corresponding path program 48 times [2019-08-05 11:03:01,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:02,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 3467 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:03:02,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26146 backedges. 4913 proven. 272 refuted. 0 times theorem prover too weak. 20961 trivial. 0 not checked. [2019-08-05 11:03:02,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:02,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:03:02,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:03:02,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:03:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:02,670 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 19 states. [2019-08-05 11:03:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:03,031 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2019-08-05 11:03:03,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:03:03,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 343 [2019-08-05 11:03:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:03,034 INFO L225 Difference]: With dead ends: 347 [2019-08-05 11:03:03,034 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 11:03:03,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:03:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 11:03:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2019-08-05 11:03:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 11:03:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 348 transitions. [2019-08-05 11:03:03,039 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 348 transitions. Word has length 343 [2019-08-05 11:03:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:03,040 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 348 transitions. [2019-08-05 11:03:03,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:03:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 348 transitions. [2019-08-05 11:03:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-08-05 11:03:03,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:03,042 INFO L399 BasicCegarLoop]: trace histogram [154, 153, 18, 17, 1, 1, 1] [2019-08-05 11:03:03,043 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1802872617, now seen corresponding path program 49 times [2019-08-05 11:03:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:03,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 3485 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:03:03,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26469 backedges. 442 proven. 24531 refuted. 0 times theorem prover too weak. 1496 trivial. 0 not checked. [2019-08-05 11:03:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:03:04,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:03:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:03:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:03:04,038 INFO L87 Difference]: Start difference. First operand 346 states and 348 transitions. Second operand 38 states. [2019-08-05 11:03:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:08,489 INFO L93 Difference]: Finished difference Result 384 states and 387 transitions. [2019-08-05 11:03:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-08-05 11:03:08,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 345 [2019-08-05 11:03:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:08,491 INFO L225 Difference]: With dead ends: 384 [2019-08-05 11:03:08,492 INFO L226 Difference]: Without dead ends: 384 [2019-08-05 11:03:08,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19108 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8815, Invalid=34657, Unknown=0, NotChecked=0, Total=43472 [2019-08-05 11:03:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-08-05 11:03:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-08-05 11:03:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 11:03:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 385 transitions. [2019-08-05 11:03:08,498 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 385 transitions. Word has length 345 [2019-08-05 11:03:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:08,499 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 385 transitions. [2019-08-05 11:03:08,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:03:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 385 transitions. [2019-08-05 11:03:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-08-05 11:03:08,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:08,501 INFO L399 BasicCegarLoop]: trace histogram [170, 169, 19, 18, 1, 1, 1] [2019-08-05 11:03:08,502 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1897359282, now seen corresponding path program 50 times [2019-08-05 11:03:08,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:08,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 3813 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:03:08,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32114 backedges. 25279 proven. 5033 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2019-08-05 11:03:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:03:09,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:03:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:03:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:03:09,575 INFO L87 Difference]: Start difference. First operand 382 states and 385 transitions. Second operand 37 states. [2019-08-05 11:03:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:10,469 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2019-08-05 11:03:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:03:10,469 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 379 [2019-08-05 11:03:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:10,471 INFO L225 Difference]: With dead ends: 382 [2019-08-05 11:03:10,472 INFO L226 Difference]: Without dead ends: 382 [2019-08-05 11:03:10,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=989, Invalid=1873, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:03:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-05 11:03:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-08-05 11:03:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 11:03:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2019-08-05 11:03:10,477 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 379 [2019-08-05 11:03:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:10,477 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2019-08-05 11:03:10,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:03:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2019-08-05 11:03:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-08-05 11:03:10,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:10,480 INFO L399 BasicCegarLoop]: trace histogram [171, 170, 19, 18, 1, 1, 1] [2019-08-05 11:03:10,480 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2041985000, now seen corresponding path program 51 times [2019-08-05 11:03:10,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 3831 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:03:10,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32472 backedges. 5832 proven. 306 refuted. 0 times theorem prover too weak. 26334 trivial. 0 not checked. [2019-08-05 11:03:11,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:11,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:03:11,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:03:11,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:03:11,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:11,172 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 20 states. [2019-08-05 11:03:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:11,541 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2019-08-05 11:03:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:03:11,542 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 381 [2019-08-05 11:03:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:11,544 INFO L225 Difference]: With dead ends: 385 [2019-08-05 11:03:11,544 INFO L226 Difference]: Without dead ends: 385 [2019-08-05 11:03:11,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:03:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-08-05 11:03:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2019-08-05 11:03:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-08-05 11:03:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 386 transitions. [2019-08-05 11:03:11,548 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 386 transitions. Word has length 381 [2019-08-05 11:03:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:11,548 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 386 transitions. [2019-08-05 11:03:11,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:03:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 386 transitions. [2019-08-05 11:03:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-08-05 11:03:11,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:11,551 INFO L399 BasicCegarLoop]: trace histogram [172, 171, 19, 18, 1, 1, 1] [2019-08-05 11:03:11,551 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -452416958, now seen corresponding path program 52 times [2019-08-05 11:03:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:11,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 3849 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:03:11,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32832 backedges. 495 proven. 30552 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-08-05 11:03:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:03:13,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:03:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:03:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:03:13,336 INFO L87 Difference]: Start difference. First operand 384 states and 386 transitions. Second operand 40 states. [2019-08-05 11:03:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:18,304 INFO L93 Difference]: Finished difference Result 424 states and 427 transitions. [2019-08-05 11:03:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-08-05 11:03:18,305 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 383 [2019-08-05 11:03:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:18,307 INFO L225 Difference]: With dead ends: 424 [2019-08-05 11:03:18,307 INFO L226 Difference]: Without dead ends: 424 [2019-08-05 11:03:18,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23583 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=10584, Invalid=42086, Unknown=0, NotChecked=0, Total=52670 [2019-08-05 11:03:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-08-05 11:03:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2019-08-05 11:03:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 11:03:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 425 transitions. [2019-08-05 11:03:18,314 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 425 transitions. Word has length 383 [2019-08-05 11:03:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:18,315 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 425 transitions. [2019-08-05 11:03:18,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:03:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 425 transitions. [2019-08-05 11:03:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-08-05 11:03:18,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:18,318 INFO L399 BasicCegarLoop]: trace histogram [189, 188, 20, 19, 1, 1, 1] [2019-08-05 11:03:18,318 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash -971656255, now seen corresponding path program 53 times [2019-08-05 11:03:18,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:18,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 4195 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:18,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 39484 backedges. 31389 proven. 5968 refuted. 0 times theorem prover too weak. 2127 trivial. 0 not checked. [2019-08-05 11:03:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:03:19,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:03:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:03:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:03:19,528 INFO L87 Difference]: Start difference. First operand 422 states and 425 transitions. Second operand 39 states. [2019-08-05 11:03:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:20,434 INFO L93 Difference]: Finished difference Result 422 states and 423 transitions. [2019-08-05 11:03:20,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:03:20,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 419 [2019-08-05 11:03:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:20,437 INFO L225 Difference]: With dead ends: 422 [2019-08-05 11:03:20,437 INFO L226 Difference]: Without dead ends: 422 [2019-08-05 11:03:20,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1101, Invalid=2091, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:03:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-08-05 11:03:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2019-08-05 11:03:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 11:03:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 423 transitions. [2019-08-05 11:03:20,443 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 423 transitions. Word has length 419 [2019-08-05 11:03:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:20,443 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 423 transitions. [2019-08-05 11:03:20,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:03:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 423 transitions. [2019-08-05 11:03:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-08-05 11:03:20,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:20,446 INFO L399 BasicCegarLoop]: trace histogram [190, 189, 20, 19, 1, 1, 1] [2019-08-05 11:03:20,446 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1012503195, now seen corresponding path program 54 times [2019-08-05 11:03:20,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:20,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 4213 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:03:20,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39881 backedges. 6859 proven. 342 refuted. 0 times theorem prover too weak. 32680 trivial. 0 not checked. [2019-08-05 11:03:21,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:21,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:03:21,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:03:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:03:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:21,303 INFO L87 Difference]: Start difference. First operand 422 states and 423 transitions. Second operand 21 states. [2019-08-05 11:03:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:21,696 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2019-08-05 11:03:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:03:21,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 421 [2019-08-05 11:03:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:21,699 INFO L225 Difference]: With dead ends: 425 [2019-08-05 11:03:21,699 INFO L226 Difference]: Without dead ends: 425 [2019-08-05 11:03:21,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:03:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-08-05 11:03:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 424. [2019-08-05 11:03:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 11:03:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 426 transitions. [2019-08-05 11:03:21,703 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 426 transitions. Word has length 421 [2019-08-05 11:03:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:21,703 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 426 transitions. [2019-08-05 11:03:21,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:03:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 426 transitions. [2019-08-05 11:03:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-08-05 11:03:21,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:21,706 INFO L399 BasicCegarLoop]: trace histogram [191, 190, 20, 19, 1, 1, 1] [2019-08-05 11:03:21,706 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1941953483, now seen corresponding path program 55 times [2019-08-05 11:03:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:22,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 4231 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:03:22,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 40280 backedges. 551 proven. 37620 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2019-08-05 11:03:23,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:03:23,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:03:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:03:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:03:23,086 INFO L87 Difference]: Start difference. First operand 424 states and 426 transitions. Second operand 42 states. [2019-08-05 11:03:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,658 INFO L93 Difference]: Finished difference Result 466 states and 469 transitions. [2019-08-05 11:03:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2019-08-05 11:03:28,659 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 423 [2019-08-05 11:03:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,661 INFO L225 Difference]: With dead ends: 466 [2019-08-05 11:03:28,661 INFO L226 Difference]: Without dead ends: 466 [2019-08-05 11:03:28,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28804 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=12606, Invalid=50646, Unknown=0, NotChecked=0, Total=63252 [2019-08-05 11:03:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-08-05 11:03:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2019-08-05 11:03:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:03:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 467 transitions. [2019-08-05 11:03:28,671 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 467 transitions. Word has length 423 [2019-08-05 11:03:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,671 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 467 transitions. [2019-08-05 11:03:28,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:03:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 467 transitions. [2019-08-05 11:03:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-08-05 11:03:28,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,674 INFO L399 BasicCegarLoop]: trace histogram [209, 208, 21, 20, 1, 1, 1] [2019-08-05 11:03:28,674 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1580728206, now seen corresponding path program 56 times [2019-08-05 11:03:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:29,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 4595 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:03:29,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 48052 backedges. 38551 proven. 7012 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2019-08-05 11:03:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:03:30,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:03:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:03:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:03:30,018 INFO L87 Difference]: Start difference. First operand 464 states and 467 transitions. Second operand 41 states. [2019-08-05 11:03:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:31,074 INFO L93 Difference]: Finished difference Result 464 states and 465 transitions. [2019-08-05 11:03:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:03:31,074 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 461 [2019-08-05 11:03:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:31,076 INFO L225 Difference]: With dead ends: 464 [2019-08-05 11:03:31,076 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 11:03:31,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1219, Invalid=2321, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:03:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 11:03:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-08-05 11:03:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:03:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-08-05 11:03:31,082 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 461 [2019-08-05 11:03:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:31,082 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-08-05 11:03:31,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:03:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-08-05 11:03:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-08-05 11:03:31,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:31,084 INFO L399 BasicCegarLoop]: trace histogram [210, 209, 21, 20, 1, 1, 1] [2019-08-05 11:03:31,084 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1596756184, now seen corresponding path program 57 times [2019-08-05 11:03:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:31,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 4613 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:03:31,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 48490 backedges. 8000 proven. 380 refuted. 0 times theorem prover too weak. 40110 trivial. 0 not checked. [2019-08-05 11:03:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:32,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:03:32,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:03:32,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:03:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:32,007 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 22 states. [2019-08-05 11:03:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:32,651 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2019-08-05 11:03:32,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:03:32,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 463 [2019-08-05 11:03:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:32,654 INFO L225 Difference]: With dead ends: 467 [2019-08-05 11:03:32,654 INFO L226 Difference]: Without dead ends: 467 [2019-08-05 11:03:32,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=590, Invalid=970, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:03:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-08-05 11:03:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2019-08-05 11:03:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-08-05 11:03:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 468 transitions. [2019-08-05 11:03:32,660 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 468 transitions. Word has length 463 [2019-08-05 11:03:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:32,660 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 468 transitions. [2019-08-05 11:03:32,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:03:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 468 transitions. [2019-08-05 11:03:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-08-05 11:03:32,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:32,663 INFO L399 BasicCegarLoop]: trace histogram [211, 210, 21, 20, 1, 1, 1] [2019-08-05 11:03:32,663 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1179315838, now seen corresponding path program 58 times [2019-08-05 11:03:32,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:33,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 4631 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:03:33,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 48930 backedges. 610 proven. 45850 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-08-05 11:03:34,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:34,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:03:34,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:03:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:03:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:03:34,087 INFO L87 Difference]: Start difference. First operand 466 states and 468 transitions. Second operand 44 states. [2019-08-05 11:03:34,347 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:03:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:40,400 INFO L93 Difference]: Finished difference Result 510 states and 513 transitions. [2019-08-05 11:03:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-08-05 11:03:40,400 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 465 [2019-08-05 11:03:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:40,403 INFO L225 Difference]: With dead ends: 510 [2019-08-05 11:03:40,403 INFO L226 Difference]: Without dead ends: 510 [2019-08-05 11:03:40,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34850 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=14904, Invalid=60446, Unknown=0, NotChecked=0, Total=75350 [2019-08-05 11:03:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-08-05 11:03:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-08-05 11:03:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 11:03:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 511 transitions. [2019-08-05 11:03:40,413 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 511 transitions. Word has length 465 [2019-08-05 11:03:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:40,414 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 511 transitions. [2019-08-05 11:03:40,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:03:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 511 transitions. [2019-08-05 11:03:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-08-05 11:03:40,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:40,417 INFO L399 BasicCegarLoop]: trace histogram [230, 229, 22, 21, 1, 1, 1] [2019-08-05 11:03:40,417 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -307757899, now seen corresponding path program 59 times [2019-08-05 11:03:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 5013 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 57941 backedges. 46880 proven. 8171 refuted. 0 times theorem prover too weak. 2890 trivial. 0 not checked. [2019-08-05 11:03:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:03:41,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:03:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:03:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:03:41,844 INFO L87 Difference]: Start difference. First operand 508 states and 511 transitions. Second operand 43 states. [2019-08-05 11:03:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:43,051 INFO L93 Difference]: Finished difference Result 508 states and 509 transitions. [2019-08-05 11:03:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:03:43,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 505 [2019-08-05 11:03:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:43,054 INFO L225 Difference]: With dead ends: 508 [2019-08-05 11:03:43,054 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 11:03:43,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1343, Invalid=2563, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:03:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 11:03:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-08-05 11:03:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 11:03:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2019-08-05 11:03:43,059 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 505 [2019-08-05 11:03:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:43,059 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2019-08-05 11:03:43,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:03:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2019-08-05 11:03:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-08-05 11:03:43,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:43,063 INFO L399 BasicCegarLoop]: trace histogram [231, 230, 22, 21, 1, 1, 1] [2019-08-05 11:03:43,063 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1583353487, now seen corresponding path program 60 times [2019-08-05 11:03:43,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:43,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 5031 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:03:43,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 58422 backedges. 9261 proven. 420 refuted. 0 times theorem prover too weak. 48741 trivial. 0 not checked. [2019-08-05 11:03:44,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:44,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:03:44,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:03:44,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:03:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:44,138 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 23 states. [2019-08-05 11:03:44,661 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:03:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:45,056 INFO L93 Difference]: Finished difference Result 511 states and 513 transitions. [2019-08-05 11:03:45,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:03:45,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 507 [2019-08-05 11:03:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:45,059 INFO L225 Difference]: With dead ends: 511 [2019-08-05 11:03:45,059 INFO L226 Difference]: Without dead ends: 511 [2019-08-05 11:03:45,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:03:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-08-05 11:03:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-08-05 11:03:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-08-05 11:03:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 512 transitions. [2019-08-05 11:03:45,065 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 512 transitions. Word has length 507 [2019-08-05 11:03:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:45,065 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 512 transitions. [2019-08-05 11:03:45,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:03:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 512 transitions. [2019-08-05 11:03:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-08-05 11:03:45,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:45,069 INFO L399 BasicCegarLoop]: trace histogram [232, 231, 22, 21, 1, 1, 1] [2019-08-05 11:03:45,069 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1184330537, now seen corresponding path program 61 times [2019-08-05 11:03:45,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:45,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 5049 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:03:45,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 58905 backedges. 672 proven. 55363 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2019-08-05 11:03:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:46,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:03:46,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:03:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:03:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:03:46,742 INFO L87 Difference]: Start difference. First operand 510 states and 512 transitions. Second operand 46 states. [2019-08-05 11:03:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:53,723 INFO L93 Difference]: Finished difference Result 556 states and 559 transitions. [2019-08-05 11:03:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-08-05 11:03:53,724 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 509 [2019-08-05 11:03:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:53,726 INFO L225 Difference]: With dead ends: 556 [2019-08-05 11:03:53,727 INFO L226 Difference]: Without dead ends: 556 [2019-08-05 11:03:53,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41804 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=17502, Invalid=71600, Unknown=0, NotChecked=0, Total=89102 [2019-08-05 11:03:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-08-05 11:03:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-08-05 11:03:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-08-05 11:03:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 557 transitions. [2019-08-05 11:03:53,739 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 557 transitions. Word has length 509 [2019-08-05 11:03:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:53,740 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 557 transitions. [2019-08-05 11:03:53,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:03:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 557 transitions. [2019-08-05 11:03:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-08-05 11:03:53,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:53,743 INFO L399 BasicCegarLoop]: trace histogram [252, 251, 23, 22, 1, 1, 1] [2019-08-05 11:03:53,744 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -828059466, now seen corresponding path program 62 times [2019-08-05 11:03:53,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:54,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 5449 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:03:54,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 69280 backedges. 56497 proven. 9451 refuted. 0 times theorem prover too weak. 3332 trivial. 0 not checked. [2019-08-05 11:03:55,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:03:55,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:03:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:03:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:03:55,462 INFO L87 Difference]: Start difference. First operand 554 states and 557 transitions. Second operand 45 states. [2019-08-05 11:03:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:56,263 INFO L93 Difference]: Finished difference Result 554 states and 555 transitions. [2019-08-05 11:03:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:03:56,264 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 551 [2019-08-05 11:03:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:56,266 INFO L225 Difference]: With dead ends: 554 [2019-08-05 11:03:56,266 INFO L226 Difference]: Without dead ends: 554 [2019-08-05 11:03:56,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1473, Invalid=2817, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:03:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-08-05 11:03:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-08-05 11:03:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-08-05 11:03:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2019-08-05 11:03:56,272 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 551 [2019-08-05 11:03:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:56,272 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2019-08-05 11:03:56,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:03:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2019-08-05 11:03:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-08-05 11:03:56,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:56,275 INFO L399 BasicCegarLoop]: trace histogram [253, 252, 23, 22, 1, 1, 1] [2019-08-05 11:03:56,275 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1359689296, now seen corresponding path program 63 times [2019-08-05 11:03:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:57,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 5467 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:03:57,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 69806 backedges. 10648 proven. 462 refuted. 0 times theorem prover too weak. 58696 trivial. 0 not checked. [2019-08-05 11:03:57,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:57,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:03:57,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:03:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:03:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:03:57,554 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 24 states. [2019-08-05 11:03:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:58,260 INFO L93 Difference]: Finished difference Result 557 states and 559 transitions. [2019-08-05 11:03:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:03:58,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 553 [2019-08-05 11:03:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:58,263 INFO L225 Difference]: With dead ends: 557 [2019-08-05 11:03:58,263 INFO L226 Difference]: Without dead ends: 557 [2019-08-05 11:03:58,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:03:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-08-05 11:03:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2019-08-05 11:03:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-08-05 11:03:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 558 transitions. [2019-08-05 11:03:58,267 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 558 transitions. Word has length 553 [2019-08-05 11:03:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:58,268 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 558 transitions. [2019-08-05 11:03:58,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:03:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 558 transitions. [2019-08-05 11:03:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-08-05 11:03:58,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:58,271 INFO L399 BasicCegarLoop]: trace histogram [254, 253, 23, 22, 1, 1, 1] [2019-08-05 11:03:58,271 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash 991407786, now seen corresponding path program 64 times [2019-08-05 11:03:58,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:59,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 5485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:03:59,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 70334 backedges. 737 proven. 66286 refuted. 0 times theorem prover too weak. 3311 trivial. 0 not checked. [2019-08-05 11:04:00,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:04:00,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:04:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:04:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:04:00,330 INFO L87 Difference]: Start difference. First operand 556 states and 558 transitions. Second operand 48 states. [2019-08-05 11:04:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:08,359 INFO L93 Difference]: Finished difference Result 604 states and 607 transitions. [2019-08-05 11:04:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2019-08-05 11:04:08,360 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 555 [2019-08-05 11:04:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:08,363 INFO L225 Difference]: With dead ends: 604 [2019-08-05 11:04:08,363 INFO L226 Difference]: Without dead ends: 604 [2019-08-05 11:04:08,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49753 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=20425, Invalid=84227, Unknown=0, NotChecked=0, Total=104652 [2019-08-05 11:04:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-08-05 11:04:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2019-08-05 11:04:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 11:04:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 605 transitions. [2019-08-05 11:04:08,375 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 605 transitions. Word has length 555 [2019-08-05 11:04:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:08,375 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 605 transitions. [2019-08-05 11:04:08,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:04:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 605 transitions. [2019-08-05 11:04:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-08-05 11:04:08,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:08,378 INFO L399 BasicCegarLoop]: trace histogram [275, 274, 24, 23, 1, 1, 1] [2019-08-05 11:04:08,378 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -452328047, now seen corresponding path program 65 times [2019-08-05 11:04:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 5903 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 82204 backedges. 67529 proven. 10858 refuted. 0 times theorem prover too weak. 3817 trivial. 0 not checked. [2019-08-05 11:04:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:04:10,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:04:10,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:04:10,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:04:10,418 INFO L87 Difference]: Start difference. First operand 602 states and 605 transitions. Second operand 47 states. [2019-08-05 11:04:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:11,271 INFO L93 Difference]: Finished difference Result 602 states and 603 transitions. [2019-08-05 11:04:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:04:11,272 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 599 [2019-08-05 11:04:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:11,275 INFO L225 Difference]: With dead ends: 602 [2019-08-05 11:04:11,275 INFO L226 Difference]: Without dead ends: 602 [2019-08-05 11:04:11,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1609, Invalid=3083, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:04:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-08-05 11:04:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-08-05 11:04:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 11:04:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 603 transitions. [2019-08-05 11:04:11,280 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 603 transitions. Word has length 599 [2019-08-05 11:04:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:11,280 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 603 transitions. [2019-08-05 11:04:11,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:04:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 603 transitions. [2019-08-05 11:04:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2019-08-05 11:04:11,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:11,283 INFO L399 BasicCegarLoop]: trace histogram [276, 275, 24, 23, 1, 1, 1] [2019-08-05 11:04:11,283 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1460277141, now seen corresponding path program 66 times [2019-08-05 11:04:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:12,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 5921 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:04:12,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 82777 backedges. 12167 proven. 506 refuted. 0 times theorem prover too weak. 70104 trivial. 0 not checked. [2019-08-05 11:04:12,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:12,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:04:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:04:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:12,735 INFO L87 Difference]: Start difference. First operand 602 states and 603 transitions. Second operand 25 states. [2019-08-05 11:04:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:13,604 INFO L93 Difference]: Finished difference Result 605 states and 607 transitions. [2019-08-05 11:04:13,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:04:13,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 601 [2019-08-05 11:04:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:13,608 INFO L225 Difference]: With dead ends: 605 [2019-08-05 11:04:13,608 INFO L226 Difference]: Without dead ends: 605 [2019-08-05 11:04:13,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=782, Invalid=1288, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:04:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-08-05 11:04:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 604. [2019-08-05 11:04:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-08-05 11:04:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 606 transitions. [2019-08-05 11:04:13,613 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 606 transitions. Word has length 601 [2019-08-05 11:04:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:13,613 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 606 transitions. [2019-08-05 11:04:13,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:04:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 606 transitions. [2019-08-05 11:04:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-08-05 11:04:13,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:13,616 INFO L399 BasicCegarLoop]: trace histogram [277, 276, 24, 23, 1, 1, 1] [2019-08-05 11:04:13,616 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1128025605, now seen corresponding path program 67 times [2019-08-05 11:04:13,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:14,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 5939 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:04:14,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 83352 backedges. 805 proven. 78752 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2019-08-05 11:04:15,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:15,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:04:15,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:04:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:04:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:04:15,752 INFO L87 Difference]: Start difference. First operand 604 states and 606 transitions. Second operand 50 states. [2019-08-05 11:04:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,695 INFO L93 Difference]: Finished difference Result 654 states and 657 transitions. [2019-08-05 11:04:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2019-08-05 11:04:24,696 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 603 [2019-08-05 11:04:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,699 INFO L225 Difference]: With dead ends: 654 [2019-08-05 11:04:24,699 INFO L226 Difference]: Without dead ends: 654 [2019-08-05 11:04:24,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58788 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=23699, Invalid=98451, Unknown=0, NotChecked=0, Total=122150 [2019-08-05 11:04:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-08-05 11:04:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-08-05 11:04:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 11:04:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 655 transitions. [2019-08-05 11:04:24,711 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 655 transitions. Word has length 603 [2019-08-05 11:04:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,712 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 655 transitions. [2019-08-05 11:04:24,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:04:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 655 transitions. [2019-08-05 11:04:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-08-05 11:04:24,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,715 INFO L399 BasicCegarLoop]: trace histogram [299, 298, 25, 24, 1, 1, 1] [2019-08-05 11:04:24,715 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash -739137082, now seen corresponding path program 68 times [2019-08-05 11:04:24,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 6375 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 96854 backedges. 80109 proven. 12398 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-08-05 11:04:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:04:27,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:04:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:04:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:04:27,259 INFO L87 Difference]: Start difference. First operand 652 states and 655 transitions. Second operand 49 states. [2019-08-05 11:04:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:28,652 INFO L93 Difference]: Finished difference Result 652 states and 653 transitions. [2019-08-05 11:04:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:04:28,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 649 [2019-08-05 11:04:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:28,655 INFO L225 Difference]: With dead ends: 652 [2019-08-05 11:04:28,655 INFO L226 Difference]: Without dead ends: 652 [2019-08-05 11:04:28,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1751, Invalid=3361, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:04:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-08-05 11:04:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2019-08-05 11:04:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 11:04:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 653 transitions. [2019-08-05 11:04:28,661 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 653 transitions. Word has length 649 [2019-08-05 11:04:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:28,661 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 653 transitions. [2019-08-05 11:04:28,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:04:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 653 transitions. [2019-08-05 11:04:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-08-05 11:04:28,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:28,665 INFO L399 BasicCegarLoop]: trace histogram [300, 299, 25, 24, 1, 1, 1] [2019-08-05 11:04:28,665 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1072737120, now seen corresponding path program 69 times [2019-08-05 11:04:28,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 6393 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 97476 backedges. 13824 proven. 552 refuted. 0 times theorem prover too weak. 83100 trivial. 0 not checked. [2019-08-05 11:04:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:04:30,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:30,592 INFO L87 Difference]: Start difference. First operand 652 states and 653 transitions. Second operand 26 states. [2019-08-05 11:04:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:31,171 INFO L93 Difference]: Finished difference Result 655 states and 657 transitions. [2019-08-05 11:04:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:04:31,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 651 [2019-08-05 11:04:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:31,176 INFO L225 Difference]: With dead ends: 655 [2019-08-05 11:04:31,176 INFO L226 Difference]: Without dead ends: 655 [2019-08-05 11:04:31,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=852, Invalid=1404, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:04:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-08-05 11:04:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2019-08-05 11:04:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-08-05 11:04:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 656 transitions. [2019-08-05 11:04:31,181 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 656 transitions. Word has length 651 [2019-08-05 11:04:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:31,182 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 656 transitions. [2019-08-05 11:04:31,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:04:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 656 transitions. [2019-08-05 11:04:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-08-05 11:04:31,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:31,185 INFO L399 BasicCegarLoop]: trace histogram [301, 300, 25, 24, 1, 1, 1] [2019-08-05 11:04:31,185 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 108273594, now seen corresponding path program 70 times [2019-08-05 11:04:31,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:32,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 6411 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:04:32,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 98100 backedges. 876 proven. 92900 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-08-05 11:04:33,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:33,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:04:33,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:04:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:04:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:04:33,791 INFO L87 Difference]: Start difference. First operand 654 states and 656 transitions. Second operand 52 states. [2019-08-05 11:04:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:44,039 INFO L93 Difference]: Finished difference Result 706 states and 709 transitions. [2019-08-05 11:04:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 330 states. [2019-08-05 11:04:44,039 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 653 [2019-08-05 11:04:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:44,043 INFO L225 Difference]: With dead ends: 706 [2019-08-05 11:04:44,043 INFO L226 Difference]: Without dead ends: 706 [2019-08-05 11:04:44,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69004 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=27351, Invalid=114401, Unknown=0, NotChecked=0, Total=141752 [2019-08-05 11:04:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-08-05 11:04:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2019-08-05 11:04:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-08-05 11:04:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 707 transitions. [2019-08-05 11:04:44,054 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 707 transitions. Word has length 653 [2019-08-05 11:04:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:44,054 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 707 transitions. [2019-08-05 11:04:44,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:04:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 707 transitions. [2019-08-05 11:04:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-08-05 11:04:44,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:44,058 INFO L399 BasicCegarLoop]: trace histogram [324, 323, 26, 25, 1, 1, 1] [2019-08-05 11:04:44,058 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2053820501, now seen corresponding path program 71 times [2019-08-05 11:04:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:45,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 6865 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 113377 backedges. 94376 proven. 14077 refuted. 0 times theorem prover too weak. 4924 trivial. 0 not checked. [2019-08-05 11:04:46,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:46,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:04:46,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:04:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:04:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:04:46,993 INFO L87 Difference]: Start difference. First operand 704 states and 707 transitions. Second operand 51 states. [2019-08-05 11:04:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:48,388 INFO L93 Difference]: Finished difference Result 704 states and 705 transitions. [2019-08-05 11:04:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:04:48,389 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 701 [2019-08-05 11:04:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:48,392 INFO L225 Difference]: With dead ends: 704 [2019-08-05 11:04:48,392 INFO L226 Difference]: Without dead ends: 704 [2019-08-05 11:04:48,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1899, Invalid=3651, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:04:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-08-05 11:04:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-08-05 11:04:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-08-05 11:04:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 705 transitions. [2019-08-05 11:04:48,398 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 705 transitions. Word has length 701 [2019-08-05 11:04:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:48,398 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 705 transitions. [2019-08-05 11:04:48,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:04:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 705 transitions. [2019-08-05 11:04:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-08-05 11:04:48,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:48,402 INFO L399 BasicCegarLoop]: trace histogram [325, 324, 26, 25, 1, 1, 1] [2019-08-05 11:04:48,402 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1030637009, now seen corresponding path program 72 times [2019-08-05 11:04:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:50,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 6883 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:04:50,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 114050 backedges. 15625 proven. 600 refuted. 0 times theorem prover too weak. 97825 trivial. 0 not checked. [2019-08-05 11:04:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:04:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:04:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:04:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:50,569 INFO L87 Difference]: Start difference. First operand 704 states and 705 transitions. Second operand 27 states. [2019-08-05 11:04:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:51,160 INFO L93 Difference]: Finished difference Result 707 states and 709 transitions. [2019-08-05 11:04:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:04:51,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 703 [2019-08-05 11:04:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:51,164 INFO L225 Difference]: With dead ends: 707 [2019-08-05 11:04:51,164 INFO L226 Difference]: Without dead ends: 707 [2019-08-05 11:04:51,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=925, Invalid=1525, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:04:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-08-05 11:04:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 706. [2019-08-05 11:04:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-08-05 11:04:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 708 transitions. [2019-08-05 11:04:51,170 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 708 transitions. Word has length 703 [2019-08-05 11:04:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:51,170 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 708 transitions. [2019-08-05 11:04:51,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:04:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 708 transitions. [2019-08-05 11:04:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2019-08-05 11:04:51,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:51,174 INFO L399 BasicCegarLoop]: trace histogram [326, 325, 26, 25, 1, 1, 1] [2019-08-05 11:04:51,175 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1695332041, now seen corresponding path program 73 times [2019-08-05 11:04:51,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:52,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 6901 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:04:52,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 114725 backedges. 950 proven. 108875 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-08-05 11:04:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:04:54,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:04:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:04:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:04:54,202 INFO L87 Difference]: Start difference. First operand 706 states and 708 transitions. Second operand 54 states. [2019-08-05 11:05:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:05,559 INFO L93 Difference]: Finished difference Result 760 states and 763 transitions. [2019-08-05 11:05:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 356 states. [2019-08-05 11:05:05,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 705 [2019-08-05 11:05:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:05,563 INFO L225 Difference]: With dead ends: 760 [2019-08-05 11:05:05,563 INFO L226 Difference]: Without dead ends: 760 [2019-08-05 11:05:05,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80500 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=31409, Invalid=132211, Unknown=0, NotChecked=0, Total=163620 [2019-08-05 11:05:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-08-05 11:05:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 758. [2019-08-05 11:05:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-08-05 11:05:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 761 transitions. [2019-08-05 11:05:05,575 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 761 transitions. Word has length 705 [2019-08-05 11:05:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:05,575 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 761 transitions. [2019-08-05 11:05:05,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:05:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 761 transitions. [2019-08-05 11:05:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2019-08-05 11:05:05,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:05,579 INFO L399 BasicCegarLoop]: trace histogram [350, 349, 27, 26, 1, 1, 1] [2019-08-05 11:05:05,580 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash 390361278, now seen corresponding path program 74 times [2019-08-05 11:05:05,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 7373 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:05:07,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 131926 backedges. 110475 proven. 15901 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2019-08-05 11:05:08,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:08,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:05:08,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:05:08,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:05:08,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:05:08,958 INFO L87 Difference]: Start difference. First operand 758 states and 761 transitions. Second operand 53 states. [2019-08-05 11:05:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,222 INFO L93 Difference]: Finished difference Result 758 states and 759 transitions. [2019-08-05 11:05:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:05:10,222 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 755 [2019-08-05 11:05:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,226 INFO L225 Difference]: With dead ends: 758 [2019-08-05 11:05:10,226 INFO L226 Difference]: Without dead ends: 758 [2019-08-05 11:05:10,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2053, Invalid=3953, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:05:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-08-05 11:05:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2019-08-05 11:05:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-08-05 11:05:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 759 transitions. [2019-08-05 11:05:10,232 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 759 transitions. Word has length 755 [2019-08-05 11:05:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,233 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 759 transitions. [2019-08-05 11:05:10,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:05:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 759 transitions. [2019-08-05 11:05:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2019-08-05 11:05:10,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,237 INFO L399 BasicCegarLoop]: trace histogram [351, 350, 27, 26, 1, 1, 1] [2019-08-05 11:05:10,237 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 214447192, now seen corresponding path program 75 times [2019-08-05 11:05:10,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 7391 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 132652 backedges. 17576 proven. 650 refuted. 0 times theorem prover too weak. 114426 trivial. 0 not checked. [2019-08-05 11:05:12,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:12,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:05:12,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:05:12,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:05:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:12,144 INFO L87 Difference]: Start difference. First operand 758 states and 759 transitions. Second operand 28 states. [2019-08-05 11:05:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:12,775 INFO L93 Difference]: Finished difference Result 761 states and 763 transitions. [2019-08-05 11:05:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:05:12,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 757 [2019-08-05 11:05:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:12,779 INFO L225 Difference]: With dead ends: 761 [2019-08-05 11:05:12,779 INFO L226 Difference]: Without dead ends: 761 [2019-08-05 11:05:12,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:05:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-08-05 11:05:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 760. [2019-08-05 11:05:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-08-05 11:05:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 762 transitions. [2019-08-05 11:05:12,785 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 762 transitions. Word has length 757 [2019-08-05 11:05:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:12,785 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 762 transitions. [2019-08-05 11:05:12,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:05:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 762 transitions. [2019-08-05 11:05:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-08-05 11:05:12,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:12,790 INFO L399 BasicCegarLoop]: trace histogram [352, 351, 27, 26, 1, 1, 1] [2019-08-05 11:05:12,790 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash -74626382, now seen corresponding path program 76 times [2019-08-05 11:05:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 7409 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 133380 backedges. 1027 proven. 126828 refuted. 0 times theorem prover too weak. 5525 trivial. 0 not checked. [2019-08-05 11:05:16,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:16,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:05:16,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:05:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:05:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:05:16,413 INFO L87 Difference]: Start difference. First operand 760 states and 762 transitions. Second operand 56 states. [2019-08-05 11:05:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:28,642 INFO L93 Difference]: Finished difference Result 816 states and 819 transitions. [2019-08-05 11:05:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 383 states. [2019-08-05 11:05:28,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 759 [2019-08-05 11:05:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:28,647 INFO L225 Difference]: With dead ends: 816 [2019-08-05 11:05:28,647 INFO L226 Difference]: Without dead ends: 816 [2019-08-05 11:05:28,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1136 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93379 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=35902, Invalid=152020, Unknown=0, NotChecked=0, Total=187922 [2019-08-05 11:05:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-08-05 11:05:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 814. [2019-08-05 11:05:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-08-05 11:05:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 817 transitions. [2019-08-05 11:05:28,658 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 817 transitions. Word has length 759 [2019-08-05 11:05:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:28,659 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 817 transitions. [2019-08-05 11:05:28,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:05:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 817 transitions. [2019-08-05 11:05:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2019-08-05 11:05:28,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:28,663 INFO L399 BasicCegarLoop]: trace histogram [377, 376, 28, 27, 1, 1, 1] [2019-08-05 11:05:28,663 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -322656511, now seen corresponding path program 77 times [2019-08-05 11:05:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:31,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 7899 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:31,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 152660 backedges. 128557 proven. 17876 refuted. 0 times theorem prover too weak. 6227 trivial. 0 not checked. [2019-08-05 11:05:32,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:05:32,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:05:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:05:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:32,516 INFO L87 Difference]: Start difference. First operand 814 states and 817 transitions. Second operand 55 states. [2019-08-05 11:05:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,606 INFO L93 Difference]: Finished difference Result 814 states and 815 transitions. [2019-08-05 11:05:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:05:34,606 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 811 [2019-08-05 11:05:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,610 INFO L225 Difference]: With dead ends: 814 [2019-08-05 11:05:34,610 INFO L226 Difference]: Without dead ends: 814 [2019-08-05 11:05:34,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2213, Invalid=4267, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:05:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-08-05 11:05:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2019-08-05 11:05:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-08-05 11:05:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 815 transitions. [2019-08-05 11:05:34,616 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 815 transitions. Word has length 811 [2019-08-05 11:05:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,617 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 815 transitions. [2019-08-05 11:05:34,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:05:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 815 transitions. [2019-08-05 11:05:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-08-05 11:05:34,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,621 INFO L399 BasicCegarLoop]: trace histogram [378, 377, 28, 27, 1, 1, 1] [2019-08-05 11:05:34,622 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1128057381, now seen corresponding path program 78 times [2019-08-05 11:05:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:37,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 7917 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:05:37,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 153441 backedges. 19683 proven. 702 refuted. 0 times theorem prover too weak. 133056 trivial. 0 not checked. [2019-08-05 11:05:37,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:37,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:05:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:05:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:37,682 INFO L87 Difference]: Start difference. First operand 814 states and 815 transitions. Second operand 29 states. [2019-08-05 11:05:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:38,362 INFO L93 Difference]: Finished difference Result 817 states and 819 transitions. [2019-08-05 11:05:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:05:38,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 813 [2019-08-05 11:05:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:38,367 INFO L225 Difference]: With dead ends: 817 [2019-08-05 11:05:38,367 INFO L226 Difference]: Without dead ends: 817 [2019-08-05 11:05:38,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1080, Invalid=1782, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:05:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-08-05 11:05:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 816. [2019-08-05 11:05:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-08-05 11:05:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 818 transitions. [2019-08-05 11:05:38,374 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 818 transitions. Word has length 813 [2019-08-05 11:05:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:38,374 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 818 transitions. [2019-08-05 11:05:38,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:05:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 818 transitions. [2019-08-05 11:05:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-08-05 11:05:38,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:38,379 INFO L399 BasicCegarLoop]: trace histogram [379, 378, 28, 27, 1, 1, 1] [2019-08-05 11:05:38,379 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1731332235, now seen corresponding path program 79 times [2019-08-05 11:05:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:40,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 7935 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:05:40,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 154224 backedges. 1107 proven. 146916 refuted. 0 times theorem prover too weak. 6201 trivial. 0 not checked. [2019-08-05 11:05:42,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:05:42,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:05:42,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:05:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:05:42,112 INFO L87 Difference]: Start difference. First operand 816 states and 818 transitions. Second operand 58 states. [2019-08-05 11:05:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:55,320 INFO L93 Difference]: Finished difference Result 874 states and 877 transitions. [2019-08-05 11:05:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2019-08-05 11:05:55,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 815 [2019-08-05 11:05:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:55,326 INFO L225 Difference]: With dead ends: 874 [2019-08-05 11:05:55,326 INFO L226 Difference]: Without dead ends: 874 [2019-08-05 11:05:55,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1220 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107748 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=40860, Invalid=173972, Unknown=0, NotChecked=0, Total=214832 [2019-08-05 11:05:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-08-05 11:05:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-08-05 11:05:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-08-05 11:05:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 875 transitions. [2019-08-05 11:05:55,344 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 875 transitions. Word has length 815 [2019-08-05 11:05:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:55,344 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 875 transitions. [2019-08-05 11:05:55,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:05:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 875 transitions. [2019-08-05 11:05:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2019-08-05 11:05:55,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:55,350 INFO L399 BasicCegarLoop]: trace histogram [405, 404, 29, 28, 1, 1, 1] [2019-08-05 11:05:55,350 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 536630174, now seen corresponding path program 80 times [2019-08-05 11:05:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:58,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 8443 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:05:58,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 175744 backedges. 148779 proven. 20008 refuted. 0 times theorem prover too weak. 6957 trivial. 0 not checked. [2019-08-05 11:05:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:59,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:05:59,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:05:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:05:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:05:59,975 INFO L87 Difference]: Start difference. First operand 872 states and 875 transitions. Second operand 57 states. [2019-08-05 11:06:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:01,986 INFO L93 Difference]: Finished difference Result 872 states and 873 transitions. [2019-08-05 11:06:01,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:06:01,987 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 869 [2019-08-05 11:06:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:01,991 INFO L225 Difference]: With dead ends: 872 [2019-08-05 11:06:01,991 INFO L226 Difference]: Without dead ends: 872 [2019-08-05 11:06:01,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2379, Invalid=4593, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:06:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-08-05 11:06:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-08-05 11:06:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-08-05 11:06:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 873 transitions. [2019-08-05 11:06:01,997 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 873 transitions. Word has length 869 [2019-08-05 11:06:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:01,998 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 873 transitions. [2019-08-05 11:06:01,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:06:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 873 transitions. [2019-08-05 11:06:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-08-05 11:06:02,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:02,003 INFO L399 BasicCegarLoop]: trace histogram [406, 405, 29, 28, 1, 1, 1] [2019-08-05 11:06:02,003 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1948418248, now seen corresponding path program 81 times [2019-08-05 11:06:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 11:06:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:05,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 8461 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:06:05,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:05,167 WARN L196 SmtUtils]: Removed 1 from assertion stack [2019-08-05 11:06:05,167 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:06:05,168 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:06:05,172 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:06:05,172 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:05 BoogieIcfgContainer [2019-08-05 11:06:05,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:05,174 INFO L168 Benchmark]: Toolchain (without parser) took 246482.19 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 110.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,174 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,175 INFO L168 Benchmark]: Boogie Preprocessor took 44.88 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,176 INFO L168 Benchmark]: RCFGBuilder took 383.64 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 94.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,176 INFO L168 Benchmark]: TraceAbstraction took 246011.47 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 94.6 MB in the beginning and 2.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 86.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:05,179 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.20 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.88 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 383.64 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 94.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246011.47 ms. Allocated memory was 141.6 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 94.6 MB in the beginning and 2.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 86.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 144). Cancelled while BasicCegarLoop was analyzing trace of length 872 with TraceHistMax 406,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 245.9s OverallTime, 83 OverallIterations, 406 TraceHistogramMax, 148.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1058 SDtfs, 2574 SDslu, 2672 SDs, 0 SdLazy, 30887 SolverSat, 3764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29985 GetRequests, 23249 SyntacticMatches, 0 SemanticMatches, 6736 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682128 ImplicationChecksByTransitivity, 146.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=872occurred in iteration=81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 82 MinimizatonAttempts, 82 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 41.4s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 25304 NumberOfCodeBlocks, 25304 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 25222 ConstructedInterpolants, 0 QuantifiedInterpolants, 33572684 SizeOfPredicates, 247 NumberOfNonLiveVariables, 253748 ConjunctsInSsa, 2218 ConjunctsInUnsatCore, 82 InterpolantComputations, 2 PerfectInterpolantSequences, 1944306/2986416 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown